Exploring a two-criterion order scheduling problem by using five heuristics

Recently the order scheduling (OS) problem is concerned by the research community. However, the OS study with more than one criterion is only few. In view of this limitation, we address an OS problem in which the objective is to find a schedule to minimize the sum of total flowtime and the maximum tardiness. The complexity of this problem is very difficult. Thus, we use five heuristics including three modified heuristics, an iterated greedy (IG) method, and a particle swarm colony (PSO) algorithm for finding approximately solutions. Finally, the statistical results and comparison performances of all five heuristics are reported.

[1]  Chelliah Sriskandarajah,et al.  Open shops with jobs overlap - revisited , 2005, Eur. J. Oper. Res..

[2]  Chin-Chia Wu,et al.  An order scheduling problem with position-based learning effect , 2016, Comput. Oper. Res..

[3]  Jay B. Ghosh,et al.  Customer order scheduling on a single machine with family setup times: Complexity and algorithms , 2007, Appl. Math. Comput..

[4]  T. C. Edwin Cheng,et al.  Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times , 2017, Appl. Soft Comput..

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

[6]  Joseph Y.-T. Leung,et al.  Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time , 2008, Ann. Oper. Res..

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

[8]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[9]  Chang Sup Sung,et al.  Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines , 1998 .

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

[11]  Zhi-Long Chen,et al.  SUPPLY CHAIN SCHEDULING: ASSEMBLY SYSTEMS , 2000 .

[12]  Ludo Gelders,et al.  Solving a bicriterion scheduling problem , 1980 .

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

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

[15]  Uttarayan Bagchi,et al.  Coordinated Scheduling of Customer Orders , 2001 .

[16]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[17]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[18]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

[20]  Joseph Y.-T. Leung,et al.  Preemptive multiprocessor order scheduling to minimize total weighted flowtime , 2008, Eur. J. Oper. Res..

[21]  Joseph Y.-T. Leung,et al.  Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines , 2007, Inf. Process. Lett..

[22]  Jose M. Framiñan,et al.  New approximate algorithms for the customer order scheduling problem with total completion time objective , 2017, Comput. Oper. Res..

[23]  James D. Blocher,et al.  Customer order scheduling in a general job shop environment , 1998 .

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

[25]  Joseph Y.-T. Leung,et al.  Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel , 2006 .

[26]  C.-H. Liu,et al.  Improving the delivery efficiency of the customer order scheduling problem in a job shop , 2009, Comput. Ind. Eng..