Three is easy, two is hard: open shop sum-batch scheduling problem refined

Operations Research Letters

Volumn 34, Issue 4, 2006, Pages 459-464

  Gribkovskaia, Irina V ^a   Lee, Chung Yee ^b   Strusevich, Vitaly A ^c   de Werra, Dominique ^d  

^a MOLDE UNIVERSITY COLLEGE   (Norway)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c UNIVERSITY OF GREENWICH   (United Kingdom)

^d EPFL   (Switzerland)

Author keywords

Batching; Open shop; Polynomial time algorithm; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; LINEAR SYSTEMS; OPTIMIZATION; SCHEDULING;

BATCHING; OPEN SHOP; POLYNOMIAL-TIME ALGORITHM;

PROBLEM SOLVING;

EID: 33646111908     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.07.006     Document Type: Article

References (7)

1. de Werra D. Graph-theoretical models for preemptive scheduling. In: Slowinski R., and Weglarz J. (Eds). Advances in Project Scheduling (1989), Elsevier, Amsterdam 171-185
2. Glass C.A., Potts C.N., and Strusevich V.A. Scheduling batches with sequential job processing for two-machine flow and open shops. INFORMS J. Comput. 13 (2001) 120-137
3. Gonzalez T., and Sahni S. Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. 23 (1976) 665-679
4. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer, Berlin
5. Lawler E.L. Old stories. In: Lenstra J.K., Rinnooy Kan A.H.G., and Schrijver A. (Eds). History of Mathematical Programming. A Collection of Personal Reminiscences (1991), CWI and North-Holland, Amsterdam 97-106
6. Pinedo M., and Schrage L. Stochastic shop scheduling: a survey. In: Dempster M.A.H., Lenstra J.K., and Rinnooy Kan A.H.G. (Eds). Deterministic and Stochastic Scheduling (1982), Riedel, Dordrecht 181-196
7. Pisinger D. Linear time algorithms for knapsack problems with bounded weights. J. Algorithms 33 (1999) 1-14