Customer Order Scheduling on Unrelated Parallel Machines to Minimize Total Completion Time

This paper considers a customer order scheduling problem with product type splitting property in the unrelated parallel machine environment. Product type splitting property refers to the case where each customer order consists of several product types and the workload of all associated product types can be arbitrarily split among machines. The objective is to minimize the total completion time of the orders. Several optimality properties of the general problem are derived. Based on these properties, an easily computable lower bound of the objective function is established. Two important special cases are further explored. Three heuristics are proposed to solve the general problem. It is shown that the worst case performances of all the three heuristics are bounded by simple functions of makespan related measures. Numerical studies are carried out to demonstrate the effectiveness of the lower bound and heuristics. Additional insights are offered by comparison studies focusing on the computational efficiency of the heuristics proposed.

[1]  Ching-Jong Liao,et al.  Tradeoff between setup times and carrying costs for finished items , 1993, Comput. Oper. Res..

[2]  Ching-Jong Liao,et al.  Sequencing with setup time and order tardiness trade‐offs , 1996 .

[3]  Scott J. Mason,et al.  Scheduling multiple orders per job in a single machine to minimize total completion time , 2010, Eur. J. Oper. Res..

[4]  Ik Sun Lee,et al.  Minimizing total tardiness for the order scheduling problem , 2013 .

[5]  Joseph Y.-T. Leung,et al.  Order Scheduling Models: An Overview , 2005 .

[6]  Uttarayan Bagchi,et al.  Coordinated scheduling of customer orders for quick response , 2005 .

[7]  Yeong-Dae Kim,et al.  A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property , 2008, Comput. Oper. Res..

[8]  Chris N. Potts,et al.  Scheduling multi‐operation jobs on a single machine , 1999, Ann. Oper. Res..

[9]  T. C. Edwin Cheng,et al.  Customer order scheduling to minimize total weighted completion time , 2007 .

[10]  François Julien.  A general framework for five machine batching models , 1992 .

[11]  Inci Saricicek,et al.  Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness , 2011 .

[12]  Joseph Y.-T. Leung,et al.  Scheduling orders for multiple product types with due date related objectives , 2006, Eur. J. Oper. Res..

[13]  Jatinder N. D. Gupta,et al.  Single machine hierarchical scheduling with customer orders and multiple job classes , 1997, Ann. Oper. Res..

[14]  T. C. Edwin Cheng,et al.  Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs , 2003, J. Sched..

[15]  Y.-D. Kim *,et al.  Parallel machine scheduling considering a job-splitting property , 2004 .

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

[17]  Paolo Serafini,et al.  Scheduling Jobs on Several Machines with the Job Splitting Property , 1996, Oper. Res..

[18]  Joseph Y.-T. Leung,et al.  Scheduling orders for multiple product types to minimize total weighted completion time , 2007, Discret. Appl. Math..

[19]  Inci Sariçiçek,et al.  Tabu Search for Parallel Machine Scheduling with Job Splitting , 2009, 2009 Sixth International Conference on Information Technology: New Generations.

[20]  Joseph Y.-T. Leung,et al.  Order Scheduling in an Environment with Dedicated Resources in Parallel , 2005, J. Sched..

[21]  Marc E. Posner,et al.  Scheduling Parallel Machines for the Customer Order Problem , 2003, J. Sched..

[22]  James D. Blocher,et al.  The customer order lead‐time problem on parallel machines , 1996 .

[23]  Farouk Yalaoui,et al.  An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times , 2003 .

[24]  Uttarayan Bagchi,et al.  Due-date assignment to multi-job customer orders , 1994 .

[25]  Jaehwan Yang,et al.  The complexity of customer order scheduling problems on parallel machines , 2005, Comput. Oper. Res..