Back to Search
Start Over
Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents.
- Source :
- Journal of the Operational Research Society; Jan2014, Vol. 65 Issue 1, p151-157, 7p
- Publication Year :
- 2014
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01605682
- Volume :
- 65
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Journal of the Operational Research Society
- Publication Type :
- Academic Journal
- Accession number :
- 92933879
- Full Text :
- https://doi.org/10.1057/jors.2013.9