Showing 1 - 10 of 16
Persistent link: https://www.econbiz.de/10012098200
Persistent link: https://www.econbiz.de/10014434462
Persistent link: https://www.econbiz.de/10011987060
The two-machine flowshop environment with sequence-independent setup times has been intensely investigated both from theoretical and practical perspectives in the scheduling literature. Nevertheless, very scant attention has been devoted to deriving effective lower bounding strategies. In this...
Persistent link: https://www.econbiz.de/10010682482
Persistent link: https://www.econbiz.de/10011514143
Persistent link: https://www.econbiz.de/10012286311
Persistent link: https://www.econbiz.de/10012014379
Persistent link: https://www.econbiz.de/10011901508
The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in its general form as well as many restricted cases even on an unlimited number of processors. In this paper, we study the problem of determining an upper bound on the minimum...
Persistent link: https://www.econbiz.de/10010847688
The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in its general form as well as many restricted cases even on an unlimited number of processors. In this paper, we study the problem of determining an upper bound on the minimum...
Persistent link: https://www.econbiz.de/10010950109