The Coordinated Scheduling Support System of Production and Delivery

Problem statement: Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. In a rapidly changing environment, competition among enterprises has a tendency to turn towards competing between supply chain systems instead of competing between individual companies. Emphasizing on the coordination and the integration among various members of a supply chain has become one of the vital strategies for the modern manufacturers to gain competitive advantages. Approach: This research focuses mainly on a class of two-stage scheduling problem, in which jobs need to be delivered to customers by vehicles after the completion of their respective production. It is assumed that the transportation time of a vehicle is constant and jobs to be delivered occupy different physical spaces. Results: The result of this research is to show the scheduling problem with the objective of minimizing total completion time is intractable and to develop a heuristic by incorporating properties inherited in an the optimal schedule. In addition, we take a Decision Support System (DSS) view to construct a Scheduling Support System (SSS) for solving the scheduling problem with delivery coordination. Conclusion/Recommendations: The scheduling support system with an additional problem management subsystem can provide more useful information for users when the management makes a strategic decision than traditional scheduling methods can. It can give firms a competitive advantage on the global competitive market.

[1]  C. N. Potts,et al.  Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..

[2]  P. L. Maggu,et al.  ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES , 1981 .

[3]  David B. Shmoys,et al.  Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[4]  Jatinder N. D. Gupta,et al.  A framework for decision support systems for scheduling problems , 1997 .

[5]  Gerhard J. Woeginger,et al.  heuristics for parallel machine scheduling with delivery times , 1994, Acta Informatica.

[6]  TransportationConsiderationsChung,et al.  Machine Scheduling with Transportation Considerations , 2000 .

[7]  Sheue-Ling Hwang,et al.  A prototype of a real-time support system in the scheduling of production systems , 1998 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Hiroshi Kise,et al.  ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER , 1991 .

[10]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[11]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[12]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[13]  Chung-Yee Lee,et al.  Machine scheduling with job delivery coordination , 2004, Eur. J. Oper. Res..

[14]  Reza H. Ahmadi,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..

[15]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[16]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[17]  Chung-Lun Li,et al.  Machine scheduling with deliveries to multiple customer locations , 2005, Eur. J. Oper. Res..