Browse > Article

Production-and-Delivery Scheduling with Transportation Mode Selection Allowed  

Cho, Jung Keun (Department of Industrial Engineering, KAIST)
Lee, Ik Sun (Department of Industrial Engineering, KAIST)
Sung, Chang Sup (Department of Industrial Engineering, KAIST)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.32, no.3, 2006 , pp. 163-171 More about this Journal
Abstract
This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.
Keywords
Production and Delivery; Branch-and-bound Algorithm; DP-Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Ahmadi, J-H. and Ahmadi, R-H. (1992), Batching and Scheduling Jobs on Batch and Discrete Processors, Operations Research, 40(4), 750-763   DOI   ScienceOn
2 Herrmann, J-W. and Lee, C-Y. (1993), On Scheduling to Minimize Earliness-Tardiness Penalties and batch Delivery Costs, European Journal of Operational Research, 70, 272-288   DOI   ScienceOn
3 Lee, C-Y. and Chen, Z-L. (2001), Machine Scheduling with Transportation Considerations, Journal of Scheduling, 4, 3-24   DOI   ScienceOn
4 Sung, C-S., Lee, I-S., and Yoon, S-H. (2006), Scheduling for a Coordinated Production-Delivery Workflow in a Supply Chain, to appear in European Journal of Operational Research
5 Potts, C-N. (1980), Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times, Operations Research, 28,1436-1441   DOI   ScienceOn
6 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   DOI   ScienceOn
7 Garcia, J-M. and Lozano, S. (2004), Coordinated Scheduling of Production and Delivery from Multiple Plants, Robotics and Computer-Integrated Manufacturing, 20, 91-198   DOI   ScienceOn
8 Park, Y-B. (2002), Production/Distribution Scheduling for Integrated Supply Chain Management, Journal of the Korean Institute of Industrial Engineers, 28, 443-453
9 Sung, C-S. and Kim, Y-H. (2002), Minimizing Makespan in a Two- Machine Flowshop with Dynamic Arrivals Allowed, European Journal of Operational Research, 29, 275-294
10 Yang, X. (2000), Scheduling with Generalized batch Delivery Dates and Earliness Penalties, IIE Transactions, 32, 735-741
11 Cheng, T-C-E. and Gordon, V-S. (1996), Single Machine Scheduling with Batch deliveries, European Journal of Operational Research, 94,277-283   DOI   ScienceOn
12 Hall, N-G. and Potts, C-N. (2001), Scheduling with Fixed Delivery Dates, Operations Research, 49(1), 134-144   DOI   ScienceOn
13 Chang, Y-C. and Lee, C-Y. (2004), Machine Scheduling with Job Delivery Coordination, European Journal of Operational Research, 158,470-487   DOI   ScienceOn
14 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-66   DOI   ScienceOn
15 Hall, N-G. and Potts, C-N. (2003), Supply Chain and Scheduling: Batching and delivery, Operations Research, 51(4), 556-584
16 Li, C-L. and Vairaktarakis, G. (2005), Machine Scheduling with Deliveries to Multiple Customer Locations, European Journal of Operational Research, 164, 39-51   DOI   ScienceOn
17 Yoo, W-S. and Martin-Vega, L-A. (2001), Scheduling Single Machine Problem for On-time Delivery, Computers and Industrial Engineering, 39, 371-392   DOI   ScienceOn