Mathematical model for cyclic scheduling with work-in-process minimization

This paper is part of an original approach of mathematical modeling for solving cyclic scheduling problems. More precisely, we consider the cyclic job shop. This kind of manufacturing systems is well fitted to medium and large production demands. Many methods have been proposed to solve the cyclic scheduling problem. Among them, we chose the exact techniques, and we focus on the mathematical programming approach. We proposed, in an earlier study, a mathematical programming model for cyclic scheduling with Work-In-Process minimization. We propose here several cutting techniques to improve the practical performances of the model resolution. Some numerical experiments are used to assess the relevance of our propositions. We made a comparison between the original mathematical model and the one endowed by the proposed cuts. This comparison is based on a set of benchmarks generated for this reason. In addition, we make another comparison based on some examples from the literature.

[1]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[2]  Roland Heilmann,et al.  Discrete Optimization A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags , 2002 .

[3]  R. Bellman.  Dynamic programming. , 1957, Science.

[4]  Robin Roundy.  Cyclic Schedules for Job Shops with Identical Jobs , 1992, Math. Oper. Res..

[5]  Ouajdi Korbaa,et al.  Formal approach of fms cyclic scheduling , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[6]  G. Goncalves,et al.  A genetic approach to the scheduling of preventive maintenance tasks on a single product manufacturing production line , 2001 .

[7]  Rémy Dupas,et al.  TWO APPROACHES TO THE CYCLIC SCHEDULING WITH ASSEMBLY , 2006 .

[8]  R. Suresh,et al.  Pareto archived simulated annealing for job shop scheduling with multiple objectives , 2006 .

[9]  J. Billaut,et al.  A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint , 2002, J. Oper. Res. Soc..

[10]  O. Fournier,et al.  Cyclic scheduling following the social behavior of ant colonies , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[11]  J. C. Gentina,et al.  Petri net modeling of ratio-driven flexible manufacturing systems and implications on the WIP for cyclic schedules , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[12]  Ouajdi Korbaa,et al.  Solving Transient Scheduling Problems with Constraint Programming , 2000, Eur. J. Control.

[13]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[14]  Can Akkan,et al.  The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm , 2004, Eur. J. Oper. Res..

[15]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[16]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[17]  Ouajdi Korbaa,et al.  A MATHEMATICAL MODEL FOR CYCLIC SCHEDULING WITH WORK-IN-PROGRESS MINIMIZATION , 2006 .

[18]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[19]  Yin Ai-hua,et al.  An improved shifting bottleneck procedure for the job shop scheduling problem , 2004 .

[20]  Jean-Marie Proth,et al.  Performance evaluation of job-shop systems using timed event-graphs , 1989 .

[21]  Tung-Kuan Liu,et al.  Improved genetic algorithm for the job-shop scheduling problem , 2006 .

[22]  Ouajdi Korbaa,et al.  A New Cyclic Scheduling Algorithm for Flexible Manufacturing Systems , 2002 .

[23]  Rémy Dupas,et al.  A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints , 2005, Eur. J. Oper. Res..

[24]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[25]  Emin Gundogar,et al.  Fuzzy priority rule for job shop scheduling , 2004, J. Intell. Manuf..

[26]  Ouajdi Korbaa,et al.  Two FMS scheduling methods based on Petri nets: A global and a local approach , 2003 .