Two-machine shop scheduling with zero and unit processing times

European Journal of Operational Research

Volumn 107, Issue 2, 1998, Pages 378-388

  Lushchakova, Irene N ^a   Kravchenko, Svetlana A ^b  

^a BELARUSIAN STATE UNIVERSITY OF INFORMATICS AND RADIOELECTRONICS   (Belarus)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Flow shop; Open shop; Optimal schedule; Polynomial algorithm

Indexed keywords

ALGORITHMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

FLOW SHOP PROBLEM; OPEN SHOP PROBLEM;

PRODUCTION ENGINEERING;

EID: 0032097086     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00337-8     Document Type: Article

References (15)

1. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic scheduling and sequencing: A survey, Annals of Discrete Mathematics 5 (1979) 287-326.
2. T. Tautenhahn, Open-shop-probleme mit Einheitsbearbeitungszeiten, Dissertation, Magdeburg, 1993.
3. C. Sriskandarajan, P. Ladet, Some no-wait shops scheduling problems: complexity aspect, European Journal of Operational Research 24 (1986) 424-438.
4. T. Gonzales, Unit execution time shop problems, Mathematics of Operations Research 7 (1982) 57-66.
5. M.R. Garey, D.S. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1 (1976) 117-129.
6. J.O. Achugbue, F.Y. Chin, Scheduling the open shop to minimize mean flow time, SIAM J. Comput. 11 (1982) 709-720.
7. V.A. Strusevich, Minimizing mean flow time for open shop , Vestnik BGU imeni V.I. Lenina. Ser.1, Fizika, Matematika, Mekhanika 1 (1988) 44-46 (in Russian).
8. V.S. Tanaev, Y.N. Sotskov, V.A. Strusevich, Scheduling Theory, Multi-Stage Systems, Kluwer Academic Publishers, Dordrecht, 1994.
9. P. Brucker, B. Jurisch, M. Jurisch, Open shop problems with unit time operations, Zeitschrift für Operations Research 37 (1993) 59-73.
10. E.M. Livshits, Y.I. Rublinetsky, On comparative complexity of some discrete optimization problems, in: Computational Mathematics and Computers, Kharkov, 3 (1972) 78-85 (in Russian).
11. J. Bruno, E.G. Coffman, R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications ACM 17 (1974) 382-387.
12. W.E. Smith, Various optimizers for single stage production, Naval Res. Logist. Quart. 3 (1956) 59-66.
13. R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of scheduling, Addison-Wesley, Reading, MA, 1967.
14. V.S. Tanaev, Preemptions in deterministic servicing systems with parallel identical machines, Vesti Akademii Navuk BSSR. Ser. fizika-matematychnykh navuk 6 (1973) 44-48 (in Russian).
15. V.S. Tanaev, V.S. Gordon, Y.M. Shafransky, Scheduling Theory. Single-Stage Systems, Kluwer Academic Publishers, Dordrecht, 1994.