Showing 1 - 10 of 21,635
Persistent link: https://www.econbiz.de/10010382878
We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each...
Persistent link: https://www.econbiz.de/10011000017
Persistent link: https://www.econbiz.de/10010259276
Persistent link: https://www.econbiz.de/10010337503
Persistent link: https://www.econbiz.de/10010222106
Persistent link: https://www.econbiz.de/10010205258
Persistent link: https://www.econbiz.de/10010242741
Persistent link: https://www.econbiz.de/10010210832
Persistent link: https://www.econbiz.de/10009689277
Persistent link: https://www.econbiz.de/10009732681