Machine scheduling with transportation considerations

Journal of Scheduling

Volumn 4, Issue 1, 2001, Pages 3-24

  Lee, Chung Yee ^a   Chen, Zhi Long ^b  

^a Texas AandM University   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344427189     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1425(200101/02)4:1<3::AID-JOS57>3.0.CO;2-D     Document Type: Article

References (31)

1. Maggu PL, Das G. On 2 × n sequencing problem with transportation times of jobs. Pure and Applied Mathematika Sciences 1980; 12:1-6.
2. Johnson SM. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1954; 1:61-68.
3. Maggu PL, Das G, Kumar R. On equivalent job-for-job block in 2 × n sequencing problem with transportation times. Journal of the OR Society of Japan 1981; 24:136-146.
4. Kise H. On an automated two-machine flowshop scheduling problem with infinite buffer. Journal of the Operations Research Society of Japan 1991; 34:354-361.
5. Stern HI, Vitner G. Scheduling parts in a combined production-transportation work cell. Journal of the Operational Research Society 1990; 41:625-632.
6. Ganesharajah T, Hall NG, Sriskandarajah C. Design and operational issues in AGV-served manufacturing systems. Annals of Operations Research 1998; 76:109-154.
7. Panwalkar SS. Scheduling of a two-machine flowshop with travel time between machines. Journal of the Operational Research Society 1991; 42:609-613.
8. Stevens JW, Gemmill DD. Scheduling a two-machine flowshop with travel times to minimize maximum lateness. International Journal of Production Research 1997; 35:1-15.
9. Mitten LG. Sequencing n jobs on two machines with arbitrary time lags. Management Science 1959; 5: 293-298.
10. Maggu PL, Singhal ML, Mohammad N, Yadav SK. On n-job, 2-machine flow-shop scheduling problem with arbitrary time lags and transportation times of jobs. Journal of the OR Society of Japan 1982; 25:219-227.
11. Langston MA. Interstage transportation planning in the deterministic flow-shop environment. Operations Research 1987; 35:556-564.
12. Yu W. The two-machine flow shop problem with delays and the one-machine total tardiness problem. Ph.D. Dissertation, Eindhoven University of Technology, 1996.
13. Potts CM. Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research 1980; 28:1436-1441.
14. Hall LA, Shmoys DB. Jackson's rule for single-machine scheduling: making a good heuristic better. Mathematics of Operations Research 1992; 17:22-35.
15. Woeginger GJ. Heuristics for parallel machine scheduling with delivery times. Acta Informatica 1994; 31:503-512.
16. Herrmann JW, Lee C-Y. On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date. European Journal of Operational Research 1993; 70:272-288.
17. Chen Z-L. Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. European Journal of Operational Research 1996; 93:49-60.
18. Cheng TCE, Gordon VS, Kovalyov MY. Single machine scheduling with batch deliveries. European Journal of Operational Research 1996; 94:277-283.
19. Yuan J. A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs. European Journal of Operational Research 1996; 94:203-205.
20. Manda BS, Palekar US. Recent advances in the design and analysis of material handling systems. Journal of Manufacturing Science and Engineering 1997; 119:841-848.
21. Raman N, Talbot FB, Rachamadugu RV. Simultaneous scheduling of machines and material handling devices in automated manufacturing. In Proceedings of the Second ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications, Stecke KE, Suri R (eds). Elsevier: Amsterdam, 1986; 455-465.
22. Jaikumar R, Solomon MM. Dynamic scheduling of automated guided vehicles for a certain class of systems. Journal of Manufacturing Systems 1990; 9:315-323.
23. Kise H, Shioyama T, Ibaraki T. Automated two-machine flowshop scheduling: a solvable case. IIE Transactions 1991; 23:10-16.
24. Levner E, Kogan K, Maimon M. Flowshop scheduling of robotic cells with job-dependent transportation and set-up effects. Journal of the Operational Research Society 1995; 46:1447-1455.
25. Bilge U, Ulusoy G. A time window approach to simultaneous scheduling of machines and material handling systems in an FMS. Operations Research 1995; 43:1058-1070.
26. Agnetis A, Pacciarelli D, Rossi F. Lot scheduling in a two-machine cell with swapping devices. IIE Transactions 1996; 28:911-917.
27. Hurink J, Knust S. Flow-shop problems with transportation times and a single robot. Preprints 1998, Fachbereich Mathematik/Informatik, Universitat Osnabruck.
28. Pinedo M. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall: Englewoods Cliffs, NJ, 1995.
29. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company: New York, 1979.
30. Ahmadi JH, Ahmadi RH, Dasu S, Tang CS. Batching and scheduling jobs on batch and discrete processors. 7 Operations Research 1992; 39:750-763.
31. Lee C-Y, Chen Z-L. Machine scheduling with transportation considerations. Working Paper, # 98-08, Department of Systems Engineering, University of Pennsylvania, 1998.