A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES

Suresh Chand; Dilip Chhajed; Rodney Traub

doi:10.1111/j.1937-5956.1994.tb00126.x

A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES

Suresh Chand, Dilip Chhajed, Rodney Traub

Business Administration

Research output: Contribution to journal › Article › peer-review

Abstract

We consider an environment where a production facility modeled as a single machine needs to assign delivery dates to several orders and find a feasible sequence. Tardy jobs are not allowed. The delivery dates are to be at prespecified fixed intervals. The objective is to minimize the due date penalty and the cost of earliness. We provide a dynamic programming‐based solution procedure that runs in polynomial time. We develop several dominance results that reduced the computational requirement by an order of magnitude in our computational study.

Original language	English (US)
Pages (from-to)	296-307
Number of pages	12
Journal	Production and Operations Management
Volume	3
Issue number	4
DOIs	https://doi.org/10.1111/j.1937-5956.1994.tb00126.x
State	Published - Dec 1994

Keywords

DYNAMIC PROGRAMMING
PRODUCTION AND OPERATIONS MANAGEMENT
SCHEDULING

ASJC Scopus subject areas

Management Science and Operations Research
Industrial and Manufacturing Engineering
Management of Technology and Innovation

Online availability

10.1111/j.1937-5956.1994.tb00126.x

Library availability

Discover UIUC Full Text

Cite this

@article{e46d2d80d2ff478d835f0bb98bb92a84,

title = "A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES",

abstract = "We consider an environment where a production facility modeled as a single machine needs to assign delivery dates to several orders and find a feasible sequence. Tardy jobs are not allowed. The delivery dates are to be at prespecified fixed intervals. The objective is to minimize the due date penalty and the cost of earliness. We provide a dynamic programming‐based solution procedure that runs in polynomial time. We develop several dominance results that reduced the computational requirement by an order of magnitude in our computational study.",

keywords = "DYNAMIC PROGRAMMING, PRODUCTION AND OPERATIONS MANAGEMENT, SCHEDULING",

author = "Suresh Chand and Dilip Chhajed and Rodney Traub",

year = "1994",

month = dec,

doi = "10.1111/j.1937-5956.1994.tb00126.x",

language = "English (US)",

volume = "3",

pages = "296--307",

journal = "Production and Operations Management",

issn = "1059-1478",

publisher = "SAGE Publications Inc.",

number = "4",

}

TY - JOUR

T1 - A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES

AU - Chand, Suresh

AU - Chhajed, Dilip

AU - Traub, Rodney

PY - 1994/12

Y1 - 1994/12

N2 - We consider an environment where a production facility modeled as a single machine needs to assign delivery dates to several orders and find a feasible sequence. Tardy jobs are not allowed. The delivery dates are to be at prespecified fixed intervals. The objective is to minimize the due date penalty and the cost of earliness. We provide a dynamic programming‐based solution procedure that runs in polynomial time. We develop several dominance results that reduced the computational requirement by an order of magnitude in our computational study.

AB - We consider an environment where a production facility modeled as a single machine needs to assign delivery dates to several orders and find a feasible sequence. Tardy jobs are not allowed. The delivery dates are to be at prespecified fixed intervals. The objective is to minimize the due date penalty and the cost of earliness. We provide a dynamic programming‐based solution procedure that runs in polynomial time. We develop several dominance results that reduced the computational requirement by an order of magnitude in our computational study.

KW - DYNAMIC PROGRAMMING

KW - PRODUCTION AND OPERATIONS MANAGEMENT

KW - SCHEDULING

UR - http://www.scopus.com/inward/record.url?scp=84986958836&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986958836&partnerID=8YFLogxK

U2 - 10.1111/j.1937-5956.1994.tb00126.x

DO - 10.1111/j.1937-5956.1994.tb00126.x

M3 - Article

AN - SCOPUS:84986958836

SN - 1059-1478

VL - 3

SP - 296

EP - 307

JO - Production and Operations Management

JF - Production and Operations Management

IS - 4

ER -

A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES

Abstract

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this