Scheduling jobshops with some identical or similar jobs

Journal of Scheduling

Volumn 4, Issue 4, 2001, Pages 177-199

  Boudoukh, Tami ^a   Perm, Michal ^a   Weiss, Gideon ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000730765     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.72     Document Type: Article

References (24)

1. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman: San Francisco, 1979.
2. Carlier J, Pinson E. An algorithm for solving the job-shop problem. Management Science 1989; 35:164-176.
3. Weiss G. On the optimal draining of a fluid re-entrant line. In: Stochastic Networks, Proceedings of IMA Workshop, Minnesota, February 1994, Kelly FP, Williams R (eds), IMA Volumes in Mathematics and its Applications, vol. 71. Springer: New York, 1995; 91-104.
4. Bertsimas D, Gamarnik D. Asymptotically optimal algorithms for job shop scheduling and packet routing. Journal of Algorithms 1999; 33:296-318.
5. Dai JG, Weiss G. A fluid heuristic for minimizing makespan in job-shops. Operations Research, To appear.
6. Boudoukh T, Penn M, Weiss G. Job-shop - application of fluid approximation. In Proceedings of the 10th Conference of Industrial Engineering and Management, Haifa Israel, Gilad I (ed.), June 1998; 254-258.
7. Williamson DP, Hall LA, Hoogeveen JA, Hurkens CAJ, Lenstra JK, Sevastyanov SV, Shmoys DB. Short shop scheduling. Operations Research 1997; 45:288-294.
8. Sevastyanov SV. Bounding algorithm for the routing problem with arbitrary paths and alternative servers. Cybernetics 1987; 22:773-781.
9. Sevastyanov SV. On some geometric methods in scheduling theory, a survey. Discrete Applied Mathematics 1994; 55:59-82.
10. Barany ID. A vector sum theorem and its application to improving flow shop guarantees. Mathematics of Operations Research 1981; 6:445-452.
11. Sevastyanov SV, Woeginger GJ. Makespan minimization in open shops, a polynomial type approximation scheme. Mathematical Programming 1998; 82:191-198.
12. Jansen K, Solis-Oba R, Srividenko M. Makespan minimization in job shops, a linear time approximation scheme. Preprint, see also preliminary versions in STOC'99 and APPROX'99, 2000.
13. Goldratt EM, Cox J. The Goal: Excellence in Manufacturing. North River Press, Croton on Hudson, New York, 1987.
14. Goldratt EM. Production, the TOC way. North River Press, 1996.
15. Hochbaum DS, Shamir R. Strongly polynomial algorithms for high multiplicity scheduling problem. Operations Research 1991; 39:648-653.
16. Roundy R. Cyclic scheduling for job shops with identical jobs, Mathematics of Operations Research 1992; 17:842-865.
17. Matsuo H. Cyclic sequencing problems in the two-machine permutation flow shop: complexity, worst-case and average-case analysis. Naval Research logistics 1990; 37:679-694.
18. McCormick ST, Pinedo ML, Shenker S, Wolf B. Sequencing in an assembly line with blocking to minimize cycle time, Operation Research 1989; 37:925-935.
19. Hanen C. Study of a NP-hard cyclic scheduling problem: the recurrent job-shop. European Journal of Operational Research 1994; 72:82-101.
20. Boudoukh T. Algorithms for solving job shop problems with identical and similar jobs, based on fluid approximation (Hebrew with English synopsis). MSc Thesis, Technion, Haifa, Israel, 1999.
21. Fisher H, Thompson GL. Probabilistic learning combinations of local job-shop scheduling rules. In Industrial Scheduling, Muth JF, Thompson GL (eds). Prentice-Hall, Englewood Cliffs, NJ, 1963; 225-251.
22. Adams J, Balas E, Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 1988; 34:391-401.
23. Martin P, Shmoys DB. A new approach to computing optimal schedules for the job-shop scheduling problem. International IPCO Conference, 1996; 389-403.
24. Andersen EJ. A new continuous model for job-shop scheduling. International Journal of Systems Science 1981; 12:1469-1475.