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

• Published in: The Journal of the Operational Research Society Vol. 65; no. 1; pp. 151 - 157
• Main Authors: Mor, B, Mosheiov, G
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis 01.01.2014; Palgrave Macmillan; Palgrave Macmillan UK; Taylor & Francis Ltd
• Subjects: Algorithms; Business and Management; Completion costs; Cost functions; Deadlines; Flow control; General Paper; General Papers; Job shops; makespan; Management; Mathematical minima; Minimization of cost; number of tardy jobs; Objective functions; Operations research; Operations Research/Decision Theory; Polynomials; Production scheduling; proportionate flowshop; Release dates; Schedules; Scheduling; Studies; total completion time; two-agent scheduling; makespan; two-agent scheduling; number of tardy jobs; total completion time; proportionate flowshop
• DOI: 10.1057/jors.2013.9
• ISSN: 0160-5682

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.