The capacitated lot sizing problem with overtime decisions and setup times

References

• Bitran , G.R. and Yanassc , H.H. ( 1982 ) Computational complexity of the capacitated lot size problem. Management Science , 28 , 1174 – 1186 .
   Web of Science ®Google Scholar
• Bowman , E.H. ( 1956 ) Production scheduling by the transportation method of linear programming. Operations Research , 3 , 100 – 103 .
   Web of Science ®Google Scholar
• Bozycl , M.A. and Ozdamar , L. ( 1996 ) A heuristic approach to the capacitated lot sizing and scheduling problem (with parallel facilities). Working Paper, Department of Systems Engineering, Yeditepe University, Istanbul.
   Google Scholar
• Catryssc , D. , Maes , J. van Wassenhove , L.N. ( 1990 ) Set partitioning and column generation heuristics for capacitated lotsizing. European Journal of Operational Research , 46 , 38 – 47 .
   Web of Science ®Google Scholar
• Dixon , P.S. , Elder , M.D. , Rand , G.K. and Silver , E.A. ( 1983 ) A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities . Journal of Operations Management , 3 , 121 – 130 .
   Google Scholar
• Dixon , P.S. and Silver , E.A. ( 1981 ) A heuristic solution procedure for the multi-item single level limited capacity lot sizing problem. Journal of Operations Management , 2 , 23 – 39 .
   Google Scholar
• Dogramaci , A. , Panayiotopoulos , J.C. and Adam , N.R. ( 1981 ) The dynamic lot sizing problem for multiple items under limited capacity. HE Transactions , 13 , 294 – 303 .
   Google Scholar
• Dowsland , K..A. ( 1993 ) Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research , 68 , 389 – 399 .
   Web of Science ®Google Scholar
• Falkenauer , E. and Bouffoix , S. ( 1991 ) A genetic algorithm for job-shop , in Proceedings of the 1991 IEEE International Conference on Robotics and Automation , Sacramento , CA .
   Google Scholar
• Garey , M. and Johnson , D. ( 1979 ) Computers and Intractability A Guide to the Theory of NP-Completeness , Freeman and Co ., San Francisco , CA .
   Google Scholar
• Gunther , H.O. ( 1987 ) Planning lot sizes and capacity requirements in a single stage production system. European Journal of Operational Research , 31 , 223 – 231 .
   Web of Science ®Google Scholar
• Hax , A.C. and Candea , D. ( 1984 ) Production and Inventory Management , Prentice-Hall Englewood Cliffs , NJ .
   Google Scholar
• Kim , D. and Mabert , V.A. ( 1995 ) Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems. International Journal of Production Research , 33 , 2007 – 2021 .
   Web of Science ®Google Scholar
• Kirca , O. ( 1990 ) An efficient algorithm for the capacitated single item dynamic lot size problem. European Journal of Operational Research , 45 , 15 – 24 .
   Web of Science ®Google Scholar
• Kirca , O. and Kokten , M. ( 1994 ) A new heuristic approach for the multi-item dynamic lot sizing problem. European Journal of Operational Research , 75 , 332 – 341 .
   Web of Science ®Google Scholar
• Kirkpatrick , A. , Gelatt , Jr. , CD. and Vechi , M.P. ( 1983 ) Optimization by simulated annealing. Science , 220 , 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Lambrecht , M.R. and Vanderveken , H. ( 1979 ) Heuristic procedure for the single operation multi-item loading problem. HE Transactions , 11 , 319 – 326 .
   Google Scholar
• Maes , J. , van Wassenhove , L.N. ( 1985 ) Multi-item single level capacitated dynamic lotsizing heuristics a computational comparison, part II rolling horizon. Working Paper 85-08, Kath-olieke Universiteit Leuven.
   Google Scholar
• Maes , J. , van Wassenhove , L.N. ( 1986 ) A simple heuristic for the multi-item single level capacitated lot sizing problem. Operations Research Letters , 4 , 265 – 273 .
   Web of Science ®Google Scholar
• Michalewicz , Z. ( 1994 ) Genetic Algorithms + Data Structures = Evolution Programs , Springer Verlag , Berlin .
   Google Scholar
• Ozdamar , L. ( 1999 ) A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man and Cybernetics , 29 , 44 – 69 .
   Web of Science ®Google Scholar
• Ozdamar , L. , Atli , A.O. and Bozyel , M.A. ( 1996 ) Heuristic family disaggregation techniques in hierarchical production planning systems . International Journal of Production Research , 34 , 2613 – 2628 .
   Web of Science ®Google Scholar
• Ozdamar , L. , Bozyel , M.A. and Birbil , I. ( 1998 ) A hierarchical decision support system for production planning (with case study). European Journal of Operations Research , 104 , 403 – 422 .
   Web of Science ®Google Scholar
• Ozdamar , L. and Yazgac , T. ( 1997 ) Capacity driven due date settings in make-to-order production systems. International Journal of Production Economics , 49 , 29 – 44 .
   Web of Science ®Google Scholar
• Portmann , M.C. ( 1996 ) Genetic algorithms and scheduling a state of the art and some propositions , in Proceedings of the Workshop on Production Planning and Control , FUCAM , Mons , Belgium , pp. 1 – 24 .
   Google Scholar
• Srinivas , M. and Patnaik , L.M. ( 1994 ) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics , 24 , 656 – 667 .
   Web of Science ®Google Scholar
• Storer , R.H. , Wu , S.D. and Vaccari , R. ( 1992 ) New search spaces for sequencing problems with application to job-shop scheduling . Management Science 38 , 1495 – 1509 .
   Web of Science ®Google Scholar
• Thizy , J.M. van Wassenhove , L.N. ( 1985 ) Lagrangean relaxation the multi-item capacitated lot sizing problem a heuristic implementation. HE Transactions , 17 , 308 – 313 .
   Google Scholar
• Trigeiro , W.W. ( 1987 ) A dual cost heuristic for the capacitated lot sizing problem. HE Transactions , 19 , 67 – 72 .
   Google Scholar
• Trigeiro , W.W. , Thomas , L.J. and McLain , J.O. ( 1989 ) Capacitated lot sizing with setup times. Management Science , 35 , 353 – 366 .
   Web of Science ®Google Scholar
• Uckun , S. , Bagchi , S. , Kawamura , K. and Miyabe , Y. ( 1993 ) Managing genetic search in job-shop scheduling. IEEE Expert , 8 , 15 – 24 .
   Google Scholar