Minimizing maximum cost on a single machine with two competing agents and job rejection

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

The classical Lawler's Algorithm provides an optimal solution to the single-machine scheduling problem, where the objective is minimizing maximum cost, given general non-decreasing, job-dependent cost functions, and general precedence constraints. First, we extend this algorithm to allow job rejection, where the scheduler may decide to process only a subset of the jobs. Then, we further extend the model to a setting of two competing agents, sharing the same processor. Both extensions are shown to be solved in polynomial time.

Original languageAmerican English
Pages (from-to)1524-1531
Number of pages8
JournalJournal of the Operational Research Society
Volume67
Issue number12
DOIs
StatePublished - 1 Dec 2016

Bibliographical note

Publisher Copyright:
© 2016 The OR Society.

Keywords

  • job rejection
  • minmax
  • precedence constraints
  • scheduling
  • single machine
  • two agents

Fingerprint

Dive into the research topics of 'Minimizing maximum cost on a single machine with two competing agents and job rejection'. Together they form a unique fingerprint.

Cite this