Preemptive job-shop scheduling problems with a fixed number of jobs

Mathematical Methods of Operations Research

Volumn 49, Issue 1, 1999, Pages 41-76

  Brucker, Peter ^a   Kravchenko, Svetlana A ^b   Sotskov, Yuri N ^b  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; POLYNOMIALS;

PREEMPTIVE JOB SHOP SCHEDULING;

SCHEDULING;

EID: 0032678122     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Brucker P (1988) An efficient algorithm for the job-shop problem with two jobs. Computing 40:353-359
2. Brucker P (1994) A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs. OR-Spektrum 16:5-7
3. Brucker P, Kravchenko SA, Sotskov YN (1997) On the complexity of two machine job-shop scheduling with separable objective functions. OR-Spektrum 19:5-10
4. Garey MR, Johnson DS, Sethi R (1976) The complexity of flow-shop and job-shop scheduling. Math. Oper. Res. 1:117-129
5. Gonzales T, Sahni S (1978) Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 263:36-52
6. Jackson JR (1956) An extension of Johnson's results on job lot scheduling. Naval Res. Logist. Quart. 3:201-203
7. Kravchenko SA (1995) Optimal scheduling for two-machine unit-time job-shop problems. Preprint N7, Institute of Engineering Cybernetics, Minsk, Belarus, (in Russian)
8. Kravchenko SA, Sotskov YN (1995) Complexity of the two machine job-shop scheduling problem with a fixed number of jobs. Institute of Engineering Cybernetics, Working paper, Minsk, Belarus
9. Kravchenko SA, Sotskov YN (1996) Optimal makespan schedule for three jobs on two machines. Z. Oper. Res. 43:233-238
10. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC et al. (eds) Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, pp. 445-552
11. Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343-362
12. Meyer W (1992) Geometrische Methoden zur Lösung von Job-Shop Problemen und deren Verallgemeinerungen. PhD Dissertation, Fachbereich Mathematik/Informatik, Universität Osnabrück, Germany, (in German).
13. Sotskov YN (1985) Optimal scheduling two jobs with regular criterion. In: Design process automating, Institute of Engineering Cybernetics, Minsk, Belarus, pp. 86-95, (in Russian)
14. Sotskov YN (1991) The complexity of shop-scheduling problems with two or three jobs. European J. Oper. Res. 53:326-336
15. Sotskov YN, Shakhlevich NV (1995) NP-hardness of shop-scheduling problems with three jobs. Discrete Appl. Math. 59:237-266
16. Timkowsky VG (1985) Polynomial-time algorithm for the Lenstra-Rinnooy Kan two-machine scheduling problem. Kibernetika (Kiev) 2:109-111, (in Russian)