Showing 1 - 8 of 8
Persistent link: https://www.econbiz.de/10011449121
Persistent link: https://www.econbiz.de/10011990253
Persistent link: https://www.econbiz.de/10012496862
Persistent link: https://www.econbiz.de/10014279039
Persistent link: https://www.econbiz.de/10011775772
Persistent link: https://www.econbiz.de/10014329166
Persistent link: https://www.econbiz.de/10014426582
We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson’s rule. For...
Persistent link: https://www.econbiz.de/10010577572