Heuristics for solving flow shop scheduling problem under resources constraints

Abstract Most of traditional scheduling problems deal with machine as the only resource, however, other resources such as raw materials is often disregards. Considering the second resource makes scheduling problems more realistic and practical to implement in manufacturing industries. Due to the applicability of flow shop environment in different manufacturing, scheduling of these types of shops are extensively studied by several authors. However, introducing an additional resource in this environment is not well studied. The present work deals with makespan minimization in flow shop scheduling problems where no renewable resources constraints are considered. The paper illustrates the importance of Johnson (1954) algorithm for the two machine flow shop under resources constraints. A mathematical model is also presented. Then a well-know heuristic is adapted to propose fast solution for the m machines flow shop problem subject to resource constraint.

[1]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[2]  Alexander Grigoriev,et al.  Basic Scheduling Problems with Raw Material Constraints , 2005 .

[3]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[4]  Zaki Sari,et al.  A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources , 2013, Int. J. Appl. Metaheuristic Comput..

[5]  Susana Carrera.  Planification et ordonnancement des plateformes logistiques , 2010 .

[6]  William T. Ziemba,et al.  Is energy self sufficiency a realistic goal for Canada? , 1981, Oper. Res. Lett..

[7]  R. Słowiński.  Preemptive scheduling of independent jobs on parallel machines subject to financial constraints , 1984 .

[8]  Jinxing Xie,et al.  Polynomial algorithms for single machine scheduling problems with financial constraints , 1997, Oper. Res. Lett..

[9]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[10]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[11]  Alexander A. Lazarev,et al.  Single machine scheduling problems with financial resource constraints: Some complexity results and properties , 2011, Math. Soc. Sci..

[12]  Vladimir Modrak,et al.  A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem , 2012 .

[13]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[14]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[15]  Aysegul Toker,et al.  Scheduling under a Non-renewable Resource Constraint , 1991 .

[16]  Alexander H. G. Rinnooy Kan,et al.  Scheduling subject to nonrenewable-resource constraints , 1982, Oper. Res. Lett..