Three is easy, two is hard: open shop sum-batch scheduling problem refined
Lee, Chung-Yee, Gribkovskaia, Irina, Strusevich, Vitaly A. and de Werra, Dominique (2006) Three is easy, two is hard: open shop sum-batch scheduling problem refined. Operations Research Letters, 34 (4). pp. 459-464. ISSN 0167-6377 (doi:10.1016/j.orl.2005.07.006)Full text not available from this repository.
For the two-machine open shop sum-batch problem to minimize the makespan an optimal schedule is known to contain
one, two or three batches on each machine, and finding a two-batch optimal schedule is NP-hard. We adapt the open shop
algorithm by de Werra for finding a three-batch optimal schedule in linear time.
|Uncontrolled Keywords:||scheduling, open shop, batching, polynomial-time algorithm|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|School / Department / Research Groups:||School of Computing & Mathematical Sciences|
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
|Last Modified:||08 Nov 2010 14:26|
Actions (login required)