A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES

SURESH CHAND, DILIP CHHAJED, RODNEY TRAUB

Research output: Contribution to journalArticlepeer-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 languageEnglish (US)
Pages (from-to)296-307
Number of pages12
JournalProduction and Operations Management
Volume3
Issue number4
DOIs
StatePublished - 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

Fingerprint Dive into the research topics of 'A SINGLE‐MACHINE SCHEDULING MODEL WITH FIXED‐INTERVAL DELIVERIES'. Together they form a unique fingerprint.

Cite this