Minmax weighted earliness-tardiness with identical processing times and two competing agents

Enrique Gerstl*, Gur Mosheiov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

A classical single machine scheduling problem is that of minimizing the maximum weighted deviation of the job completion times from a common due-date, assuming identical processing times. We extend this problem to a setting of two competing agents sharing the same machine. We first focus on the case that the objective is of minimizing the maximum weighted deviation of the jobs of the first agent subject to an upper bound on the maximum weighted deviation of the jobs of the second agent. Then we extend this model to a setting of asymmetric cost structure, i.e., the (job- and agent-dependent) earliness and tardiness costs may be different. We also consider a modified model with a minsum measure for the second agent: the objective is of minimizing the maximum weighted deviation of the jobs of the first agent from a common due-date subject to an upper bound on the total weighted deviation of the jobs of the second agent. All these models are also extended to a general setting of job-dependent due-dates. Polynomial time solutions are introduced for all the problems studied in this paper.

Original languageAmerican English
Pages (from-to)171-177
Number of pages7
JournalComputers and Industrial Engineering
Volume107
DOIs
StatePublished - 1 May 2017

Bibliographical note

Publisher Copyright:
© 2017 Elsevier Ltd

Keywords

  • Earliness-tardiness
  • Scheduling
  • Single machine
  • Two-agents

Fingerprint

Dive into the research topics of 'Minmax weighted earliness-tardiness with identical processing times and two competing agents'. Together they form a unique fingerprint.

Cite this