Showing 1 - 10 of 12
Persistent link: https://www.econbiz.de/10011566522
Persistent link: https://www.econbiz.de/10008826406
Persistent link: https://www.econbiz.de/10010531966
Persistent link: https://www.econbiz.de/10012306652
Persistent link: https://www.econbiz.de/10012253790
Persistent link: https://www.econbiz.de/10012193315
Persistent link: https://www.econbiz.de/10012193486
Persistent link: https://www.econbiz.de/10012130698
Persistent link: https://www.econbiz.de/10012425475
In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is characterized by two flows of jobs that cover the same machines in opposite directions. The objective is to minimize the maximal completion time of the jobs (i.e., the makespan).
Persistent link: https://www.econbiz.de/10011209333