Minmax scheduling problems with common flow-allowance

B. Mor, G. Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

In due-date assignment problems with a common flow-allowance, the due-date of a given job is defined as the sum of its processing time and a job-independent constant. We study flow-allowance on a single machine, with an objective function of a minmax type. The total cost of a given job consists of its earliness/tardiness and its flow-allowance cost components. Thus, we seek the job schedule and flow-allowance value that minimize the largest cost among all the jobs. Three extensions are considered: the case of general position-dependent processing times, the model containing an explicit cost for the due-dates, and the setting of due-windows. Properties of optimal schedules are fully analysed in all cases, and all the problems are shown to have polynomial time solutions.

Original languageAmerican English
Pages (from-to)1284-1293
Number of pages10
JournalJournal of the Operational Research Society
Volume63
Issue number9
DOIs
StatePublished - Sep 2012

Keywords

  • due-date assignment
  • flow-allowance
  • minmax
  • scheduling

Fingerprint

Dive into the research topics of 'Minmax scheduling problems with common flow-allowance'. Together they form a unique fingerprint.

Cite this