Showing 1 - 10 of 51
Persistent link: https://www.econbiz.de/10002979703
Persistent link: https://www.econbiz.de/10002979711
Persistent link: https://www.econbiz.de/10002979723
Persistent link: https://www.econbiz.de/10003705405
Persistent link: https://www.econbiz.de/10015150636
Persistent link: https://www.econbiz.de/10015150869
In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a...
Persistent link: https://www.econbiz.de/10004973581
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/10010950009
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