A note: A due-window assignment problem on parallel identical machines

G. Mosheiov*, A. Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

We solve a due-window assignment problem on parallel identical machines. In addition to the standard objective of finding the optimal job schedule, in due-window assignment problems one has to assign a time interval during which goods are delivered to customers with no cost. Jobs scheduled prior to or after the due-window are penalized according to their earliness/tardiness value. We assume that jobs have identical processing times, but may have job-dependent earliness and tardiness costs (eg, due to possible different destinations). We show that the problem can be reduced to a non-standard asymmetric assignment problem, and introduce an efficient (O(n4)) solution procedure.

Original languageAmerican English
Pages (from-to)238-241
Number of pages4
JournalJournal of the Operational Research Society
Volume62
Issue number1
DOIs
StatePublished - Jan 2011

Bibliographical note

Funding Information:
Acknowledgements—The first author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. The paper was supported in past by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • assignment problem
  • cheduling
  • due-window
  • earliness-tardiness
  • parallel machines

Fingerprint

Dive into the research topics of 'A note: A due-window assignment problem on parallel identical machines'. Together they form a unique fingerprint.

Cite this