Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents

B. Mor, G. Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

31 Scopus citations

Abstract

In scheduling problems with two competing agents, each one of the agents has his own set of jobs and his own objective function, but both share the same processor. The goal is to minimize 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. In this paper we study two-agent scheduling problems on a proportionate flowshop. Three objective functions of the first agent are considered: minimum maximum cost of all the jobs, minimum total completion time, and minimum number of tardy jobs. For the second agent, an upper bound on the maximum allowable cost is assumed. We introduce efficient polynomial time solution algorithms for all cases.

Original languageAmerican English
Pages (from-to)151-157
Number of pages7
JournalJournal of the Operational Research Society
Volume65
Issue number1
DOIs
StatePublished - Jan 2014

Bibliographical note

Funding Information:
Acknowledgements—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

  • makespan
  • number of tardy jobs
  • proportionate flowshop
  • total completion time
  • two-agent scheduling

Fingerprint

Dive into the research topics of 'Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents'. Together they form a unique fingerprint.

Cite this