Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines

This paper deals with a realistic cyclic scheduling problem in the food industry environment in which parallel machines are considered to process perishable jobs with given release dates, due dates and deadlines. Jobs are subject to post-production shelf life limitation and must be delivered to retailers during the corresponding time window bounded by due dates and deadlines. Both early and tardy jobs are penalized by partial weighted earliness/tardiness functions and the overall problem is to provide a cyclic schedule of minimum cost. A mixed integer programming model is proposed and a heuristic solution beside an iterated greedy algorithm is developed to generate good and feasible solutions for the problem. The proposed MIP, heuristic and iterated greedy produce a series of solutions covering a wide range of cases from slow optimal solutions to quick and approximated schedules.

[1]  Xin Wang,et al.  Integrated production and delivery scheduling with disjoint windows , 2009, Discret. Appl. Math..

[2]  Sabah U. Randhawa,et al.  Scheduling in Multistage Flowshop Systems , 1994 .

[3]  Chetan Soman,et al.  Capacitated planning and scheduling for combined make-to-order and make-to-stock production in the food industry: An illustrative case study , 2007 .

[4]  Emmanuel Néron,et al.  Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines , 2004, Oper. Res. Lett..

[5]  Gur Mosheiov,et al.  Scheduling identical jobs and due-window on uniform machines , 2010, Eur. J. Oper. Res..

[6]  Gur Mosheiov,et al.  Scheduling a maintenance activity and due-window assignment based on common flow allowance , 2012 .

[7]  Claire Hanen,et al.  A Study of the Cyclic Scheduling Problem on Parallel Processors , 1995, Discret. Appl. Math..

[8]  Marco Chiarandini,et al.  Synchronized permutation tests in replicated I×J designs , 2007 .

[9]  Frank Werner,et al.  Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey , 2004, Math. Comput. Model..

[10]  Bilge Bilgen,et al.  Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling , 2013, Ann. Oper. Res..

[11]  V. Donk.  Make to stock or make to order: the decoupling point in the food processing industries , 2001 .

[12]  Zhi-Long Chen,et al.  Parallel machine scheduling with a common due window , 2002, Eur. J. Oper. Res..

[13]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[14]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

[15]  Francis Sourd,et al.  Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints , 2006, Oper. Res. Lett..

[16]  R. J. Kuo,et al.  Hybrid meta-heuristic algorithm for job shop scheduling with due date time window and release time , 2013 .

[17]  Roberto Tadei,et al.  Aggregate planning and scheduling in the food industry: A case study , 1995 .

[18]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[19]  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..

[20]  Philippe Baptiste,et al.  Scheduling a single machine to minimize a regular objective function under setup constraints , 2005, Discret. Optim..

[21]  Rubén Ruiz,et al.  Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems , 2011, Comput. Oper. Res..

[22]  V. Guiard,et al.  The robustness of parametric statistical methods , 2004 .

[23]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[24]  Premysl Sucha,et al.  Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times , 2008, Math. Comput. Model..

[25]  D. P. Donk,et al.  Combined make-to-order and make-to-stock in a food production system , 2004 .

[26]  Norbert Trautmann,et al.  A cyclic approach to large-scale short-term planning in chemical batch production , 2009, J. Sched..

[27]  T. C. Edwin Cheng,et al.  Complexity of cyclic scheduling problems: A state-of-the-art survey , 2010, Comput. Ind. Eng..

[28]  Kuo-Ching Ying,et al.  Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic , 2010, Expert Syst. Appl..

[29]  Frank Werner,et al.  Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties , 2001 .

[30]  Ghaith Rabadi,et al.  Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times , 2012, Comput. Ind. Eng..

[31]  Alcione de Paiva Oliveira,et al.  Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows , 2011, CLEI Selected Papers.

[32]  G.D.H. Claassen,et al.  Planning and scheduling packaging lines in food industry , 1993 .

[33]  Hong He,et al.  Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm , 2011, J. Syst. Softw..

[34]  Susan Linko,et al.  Expert systems—what can they do for the food industry? , 1998 .