Showing 1 - 10 of 213
The paper surveys the complexity results for job shop, flow shop, open shop and mixed shop scheduling problems when the number n of jobs is fixed while the number r of operations per job is not restricted. In such cases, the asymptotical complexity of scheduling algorithms depends on the number...
Persistent link: https://www.econbiz.de/10010950258
The paper surveys the complexity results for job shop, flow shop, open shop and mixed shop scheduling problems when the number n of jobs is fixed while the number r of operations per job is not restricted. In such cases, the asymptotical complexity of scheduling algorithms depends on the number...
Persistent link: https://www.econbiz.de/10010847871
Persistent link: https://www.econbiz.de/10003473321
Persistent link: https://www.econbiz.de/10008218917
Persistent link: https://www.econbiz.de/10000091471
Persistent link: https://www.econbiz.de/10000053105
Persistent link: https://www.econbiz.de/10001323303
Persistent link: https://www.econbiz.de/10001161758
Persistent link: https://www.econbiz.de/10001256847
Persistent link: https://www.econbiz.de/10001954527