Showing 71 - 80 of 101
We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one...
Persistent link: https://www.econbiz.de/10010950058
Persistent link: https://www.econbiz.de/10007356872
Persistent link: https://www.econbiz.de/10004679330
Persistent link: https://www.econbiz.de/10006128486
Persistent link: https://www.econbiz.de/10006133978
Persistent link: https://www.econbiz.de/10006613760
Persistent link: https://www.econbiz.de/10006664400
Persistent link: https://www.econbiz.de/10006672618
Persistent link: https://www.econbiz.de/10008236142