Open shop scheduling with maximal machines

✍ Scribed by George J. Kyparisis; Christos Koulamas

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 698 KB
• Volume: 78
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(97)00018-8

✦ Synopsis

The objective of this paper is to develop polynomial algorithms

for the open shop makespan problem. It is shown that when a machine majorizes all other machines and the ith largest processing time on that machine is at least as large as the processing times of all operations on machines i through m, the problem becomes polynomially solvable. The utilization of the duality property between jobs and machines leads to a similar polynomial algorithm when a job majorizes all other jobs and the ith largest processing time of this job is at least as large as the processing times of all operations for jobs i through n.