An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs

Enrique Gerstl*, Gur Mosheiov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

We study a due-window assignment problem on parallel identical machines, with unit processing time jobs. The objective function is minimum total cost, consisting of earliness, tardiness, due-window starting time and due-window size. A recent paper (Janiak et al., 2012) introduced a solution algorithm requiring O(n5/m2) time, where n is the number of jobs, and m is the number of machines. We propose a significantly faster procedure, requiring O(n3) only.

Original languageAmerican English
Pages (from-to)754-759
Number of pages6
JournalInformation Processing Letters
Volume113
Issue number19-21
DOIs
StatePublished - 2013

Bibliographical note

Funding Information:
This paper was supported in part by The Charles Rosen Chair of Management and the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Assignment problem
  • Due-window
  • Earliness-tardiness
  • Parallel machines
  • Scheduling

Fingerprint

Dive into the research topics of 'An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs'. Together they form a unique fingerprint.

Cite this