Mixed Binary Integer Programming Formulation for the Two-Echelon Supply Chain System with Two Customer Locations

10.6186/IJIMS.2012.23.4.2

Jen-Shiang Chen

Scheduling ； single machine ； arrival time ； supply chain ； mixed binary integer programming

International Journal of Information and Management Sciences

23:4（2012 / 12 / 01）

359 - 369

英文

Coordinating works between production and delivery is a crucial issue for the management of production and logistics. This study developed a single machine scheduling model that incorporated delivery vehicle routing decisions and serves two customer locations. The objective was to minimize the mean arrival time. The problem is NP-hard in the strong sense in general. A mixed binary integer programming (BIP) model was developed to optimally solve this problem. In addition, computational results of the illustrative example are reported using the mixed BIP model to solve the proposed problem.

1. Chang, Y. C.,Lee, C. Y.(2004).Machine scheduling with job delivery coordination.European Journal of Operational Research,158,470-487.
2. Chen, Z. L.(1996).Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs.European Journal of Operational Research,93,49-60.
3. Cheng, T. C. E.,Gordon, V. S.,Kovalyov, M. Y.(1996).Single machine scheduling with batch deliveries.European Journal of Operational Research,94,277-283.
4. Equi, L.,Gallo, G.,Marziale, S.,Weintraub, A.(1997).A combined transportation and scheduling problem.European Journal of Operational Research,97,94-104.
5. Garcia, J. M.,Lozano, S.,Canca, D.(2004).Coordinated scheduling of production and delivery from multiple plants.Robotics and Computer-Integrated Manufacturing,20,191-198.
6. Gharbi, A.,Haouari, M.(2002).Minimizing makespan on parallel machines subject to release dates and delivery times.Journal of Scheduling,5,329-355.
7. Hall, L. A.,Shmoys, D. B.(1992).Jackson's rule for single-machine scheduling: making a good heuristic better.Mathematics of Operations Research,17,22-35.
8. Hall, N. G.,Potts, C. N.(2003).Supply chain scheduling: Batching and delivery.Operations Research,51,566-584.
9. Herrmann, J. W.,Lee, C. Y.(1993).On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date.European Journal of Operational Research,70,272-288.
10. Lee, C. Y.,Chen, Z. L.(2001).Machine scheduling with transportation considerations.Journal of Scheduling,4,3-24.
11. Li, C. L.,Vairaktarakis, G.,Lee, C. Y.(2005).Machine scheduling with deliveries to multiple customer locations.European Journal of Operational Research,164,39-51.
12. Liu, Z.,Cheng, T. C. E.(2002).Scheduling with job release dates, delivery times and preemption penalties.Information Processing Letters,82,107-111.
13. Morten, T. E.,Pentico, D. W.(1993).Heuristic Scheduling Systems.New York:Wiley.
14. Potts, C. N.(1980).Analysis of a heuristic for one machine sequencing with release dates and delivery times.Operations Research,28,1436-1441.
15. Potts, C. N.,Kovalyov, M. Y.(2000).Scheduling with batching: A review.European Journal of Operational Research,120,228-249.
16. Potts, C. N.,Van Wassenhove, L. N.(1992).Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity.Journal of the Operational Research Society,43,395-406.
17. Rinnooy Kan, A. H. G.(1976).Machine Scheduling Problems: Classification.Martinus Nijhoff, Holland:Complexity and Computations.
18. Stadtler, H.(2005).Supply chain management and advanced planning basics, overview and challenges.European Journal of Operational Research,163,575-588.
19. Wang, G.,Cheng, T. C. E.(2000).Parallel machine scheduling with batch delivery costs.International Journal of Production Economics,68,177-183.
20. Webster, S.,Baker, K. R.(1995).Scheduling groups of jobs on a single machine.Operations Research,43,692-703.
21. Woeginger, G. J.(1998).A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times.Journal of Scheduling,1,79-87.
22. Woeginger, G. J.(1994).Heuristics for parallel machine scheduling with delivery times.Acta Informatica,31,503-512.
23. Yuan, J.(1996).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,94,203-205.
24. Zdrza lka, S.(1995).Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times.European Journal of Operational Research,80,371-380.