A due-window assignment problem with position-dependent processing times

G. Mosheiov*, A. Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

45 Scopus citations

Abstract

We extend a classical single-machine due-window assignment problem to the case of position-dependent processing times. In addition to the standard job scheduling decisions, one has to assign a time interval (due-window), such that jobs completed within this interval are assumed to be on time and not penalized. The cost components are: total earliness, total tardiness and due-window location and size. We introduce an O(n3) solution algorithm, where n is the number of jobs. We also investigate several special cases, and examine numerically the sensitivity of the solution (schedule and due-window) to the different cost parameters.

Original languageAmerican English
Pages (from-to)997-1003
Number of pages7
JournalJournal of the Operational Research Society
Volume59
Issue number7
DOIs
StatePublished - Jul 2008

Bibliographical note

Funding Information:
Acknowledgement— This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Due-window
  • Earliness-tardiness
  • Position-dependent processing times
  • Scheduling

Fingerprint

Dive into the research topics of 'A due-window assignment problem with position-dependent processing times'. Together they form a unique fingerprint.

Cite this