A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Scopus citations

Abstract

We study a single-machine scheduling model combining two competing agents and due-date assignment. The basic setting involves two agents who need to process their own sets of jobs, and compete on the use of a common processor. Our goal is to find the joint schedule that minimizes the value of the objective function of one agent, subject to an upper bound on the value of the objective function of the second agent. The scheduling measure considered in this paper is minimum total (earliness, tardiness and due-date) cost, based on common flow allowance, i.e., due-dates are defined as linear functions of the job processing times. We introduce a simple polynomial time solution for this problem (linear in the number of jobs), as well as to its extension to a multi-agent setting. We further extend the model to that of a due-window assignment based on common flow allowance.

Original languageAmerican English
Pages (from-to)1454-1468
Number of pages15
JournalJournal of Combinatorial Optimization
Volume33
Issue number4
DOIs
StatePublished - 1 May 2017

Bibliographical note

Publisher Copyright:
© 2016, Springer Science+Business Media New York.

Keywords

  • Common flow-allowance
  • Minmax
  • Scheduling
  • Single machine
  • Two agents

Fingerprint

Dive into the research topics of 'A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance'. Together they form a unique fingerprint.

Cite this