Machine scheduling with deliveries to multiple customer locations

European Journal of Operational Research

Volumn 164, Issue 1, 2005, Pages 39-51

  Li, Chung Lun ^a   Vairaktarakis, George ^b   Lee, Chung Yee ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

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

Author keywords

Computational complexity; Dynamic programming; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; WAREHOUSES;

DELIVERY SCHEDULES; LOGISTICS MANAGEMENT; SCHEDULING MODELS; SHORTEST PROCESSING TIME (SPT);

OPERATIONS RESEARCH;

EID: 10444261222     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.11.022     Document Type: Article

References (17)

1. F. Afrati, S. Cosmadakis, C.H. Papadimitriou, G. Papageorgiou, The complexity of the travelling repairman problem, Theoretical Informatics and Applications 20 (1986) 79-87.
2. Y.-C. Chang, C.-Y. Lee, Machine scheduling with job delivery coordination, European Journal of Operational Research, in press.
3. Z.-L. Chen, G.L. Vairaktarakis, Integrated scheduling of production and distribution operations, Management Science, in press.
4. H.N., Geismar, L. Lei, C. Sriskandarajah, The integrated production and transportation scheduling problem for a product with a short life span and non-instantaneous transportation time, submitted for publication.
5. L.A. Hall, D.B. Shmoys, Jackson's rule of single-machine scheduling: Making a good heuristic better, Mathematics of Operations Research 17 (1992) 22-35.
6. H. Kise, T. Shioyama, T. Ibaraki, Automated two-machine flowshop scheduling: A solvable case, IIE Transactions 23 (1991) 10-16.
7. M.A. Langsten, Interstage transportation planning in the deterministic flow-shop environment, Operations Research 35 (1987) 556-564.
8. C.-Y. Lee, Z.-L. Chen, Machine scheduling with transportation considerations, Journal of Scheduling 4 (2001) 3-24.
9. P.L. Maggu, G. Das, On 2 × n sequencing problem with transportation times of jobs, Pure and Applied Mathematika Sciences 12 (1980) 1-6.
10. P.L. Maggu, G. Das, R. Kumar, On equivalent-job for job-block in 2 × n sequencing problem with transportation-times, Journal of the Operations Research Society of Japan 24 (1981) 136-146.
11. S.S. Panwalkar, Scheduling of a two-machine flowshop with travel time between machines, Journal of the Operational Research Society 42 (1991) 609-613.
12. C.N. Potts, Analysis of a heuristic for one machine sequencing with release dates and delivery times, Operations Research 28 (1980) 1436-1441.
13. S. Sahni, T. Gonzalez, P-complete approximation problems, Journal of the Association for Computing Machinery 23 (1976) 555-565.
14. S. Sahni, G. Vairaktarakis, The master-slave paradigm in parallel computer and industrial settings, Journal of Global Optimization 9 (1996) 357-377.
15. H.I. Stern, G. Vitner, Scheduling parts in a combined production-transportation work cell, Journal of the Operational Research Society 41 (1990) 625-632.
16. J.W. Stevens, D.D. Germill, Scheduling a two-machine flowshop with travel times to minimize maximum lateness, International Journal of Production Research 35 (1997) 1-15.
17. G. Vairaktarakis, Analysis of algorithms for master-slave systems, IIE Transactions 29 (1997) 939-949.