A Simulated Annealing Algorithm for the Capacitated Lot-sizing and Scheduling problem under Sequence-Dependent Setup Costs and Setup Times

Jiyoung Jung ` Sungsoo ParkDepartment of Industrial Engineering, KAISTIn this research, the single machine capacitated lot-sizing and scheduling problem with sequence- dependent setup costs and setup times (CLSPSD) is considered. This problem is the extension of capacitated lot-sizing and scheduling problem (CLSP) with an additional assumption on sequence-dependent setup costs and setup times. The objective of the problem is minimizing the sum of production costs, inventory holding costs and setup costs satisfying customers’ demands.It is known that the CLSPSD is NP-hard. In this paper, the MIP formulation is presented. To handle the problem more efficiently, a conceptual model is suggested, and one of the well-known meta-heuristics, the simulated annealing approach is applied. To illustrate the performance of this approach, various instances are tested and the results of this algorithm are compared with those of the CLPEX. Computational results show that this approach generates optimal or nearly optimal solutions.Keywords : lot-sizing, sequence-dependent setup costs, simulated annealing algorithm

[1]  Knut Haase,et al.  Capacitated lot-sizing with sequence dependent setup costs , 1996 .

[2]  Harish C. Bahl,et al.  Capacitated lot-sizing and scheduling by Lagrangean relaxation , 1992 .

[3]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  R. Kuik,et al.  Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic , 1990 .

[6]  Lloyd A. Swanson,et al.  A lot sizing and sequencing algorithm for dynamic demands upon a single facility , 1982 .

[7]  Diwakar Gupta,et al.  The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times , 2005, Comput. Oper. Res..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[10]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

[11]  Ke Ding,et al.  A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover , 2001, Manag. Sci..

[12]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[14]  Ou Tang,et al.  Simulated annealing in lot sizing problems , 2004 .

[15]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[16]  Kavindra Malik,et al.  Lotsizing and Scheduling in Parallel Machines with Sequence-Dependent Setup Costs , 1999 .

[17]  Stéphane Dauzère-Pérès,et al.  Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows , 1997, Eur. J. Oper. Res..