Due-window assignment with identical jobs on parallel uniform machines

Enrique Gerstl, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is studied. We focus on the setting of both (i) job-dependent earliness/tardiness job weights and (ii) parallel uniform machines. The objective is to find the job allocation to the machines and the job schedule, such that the total weighted earliness and tardiness cost is minimized. We study both cases of a non-restrictive (i.e. sufficiently late), and a restrictive due-window. For a given number of machines, the solutions of the problems studied here are obtained in polynomial time in the number of jobs.

Original languageAmerican English
Pages (from-to)41-47
Number of pages7
JournalEuropean Journal of Operational Research
Volume229
Issue number1
DOIs
StatePublished - 16 Aug 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 uniform machines
  • Scheduling

Fingerprint

Dive into the research topics of 'Due-window assignment with identical jobs on parallel uniform machines'. Together they form a unique fingerprint.

Cite this