Abstract
A hybrid genetic algorithm (HGA) is proposed for the single machine, single stage, scheduling problem in a sequence dependent setup time environment within a fixed planning horizon (SSSDP). It incorporates the elitist ranking method, genetic operators, and a hill-climbing technique in each searching area. To improve the performance and efficiency, hill climbing is performed by uniting the Wagner-Whitin Algorithm with the problem-specific knowledge. The objective of the HGA is to minimize the sum of setup cost, inventory cost, and backlog cost. The HGA is able to obtain a superior solution, if it is not optimal, in a reasonable time. The computational results of this algorithm on real life SSSDP problems are promising. In our test cases, the HGA performed up to 50% better than the Just-In-Time heuristics and 30% better than the complete batching heuristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arosio, M. and A. Sianesi. (1993). “A Heuristic Algorithm for Master Production Schedule Generation with Finite Capacity and Sequence Dependent Setups,” International Journal of Production Research 31(3), 531–553.
Bellman, R., A.O. Esogbue, and I. Nabeshima. (1982). Mathematical Aspects of Scheduling and Applications. Pergamon Press.
Brandimarte, P. and A. Villa. (1995). Optimization Models and Concepts in Production Management. Gordon and Breach Publisher.
Caveny, R.S. (1994). “Max-Min Allocation of a Multi-item, Single Machine Production System with Different Setup Times,” PhD Dissertation, Department of Management Science and Statistics, The University of Alabama.
Cheng, T.C.E., Z.L. Chen, and C. Oguz. (1994). “One Machine Batching and Sequencing of Multiple-Type Items,” Computers and Operations Research 21(7), 717–721.
Cho, Kyu-Kab, Kap Hwan Kim, and Chan Soo Kim. (1994). “A Heuristic Lot-sizing Algorithm for a GT Cell,” Computers and Industrial Engineering 26(1), 1–9.
Dilts, D.M. and K.D. Ramsing. (1989). “Joint Lot Sizing and Scheduling of Multiple Items with Sequence dependent Setup Costs,” Decision Science 20, 120–133.
Dobson, Gregory, U.S. Karmarkar, and Jeffery L. Rummel. (1987). “Batching to Minimize Flow Times on One Machine,” Management Science 33(6), 784–789.
Doll, C.L. and D.C. Whybark. (1973). “An Iterative Procedure for the Single Machine Multi-Product Lot Scheduling Problem,” Management Science 20, 0–55.
Driscoll, W.C. and H. Emmons. (1977). “Scheduling Production on One Machine with Changeover Costs,” AIIE Transactions 9, 388–395.
Feo, Thomas A., Kishore Sarathy, and John McGahan. (1996). “A GRASP for Single Machine Scheduling with Sequence Dependent Setup Costs and Linear Delay Penalties,” Computers and Operations Research 23(9), 881–895.
Fleischmann, Berhard. (1994). “The Discrete Lot Sizing and Scheduling Problem (DLSP) with Sequence Dependent Setup Costs,” European Journal of Operational Research 75(1), 395–404.
Galvin, T.M. (1987). “Economic Lot Scheduling Problem with Sequence Dependent Setup Costs,” Production and Inventory Management, First Quarter, 96–105.
Glover, F. and H.J. Greenberg. (1989). “New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence,” European Journal of Operational Research 39, 119–130.
Goldberg, David E. (1989). Genetic Algorithms in Search; Optimization; and Machine Learning. Addison-Wesley Publishing Company, Inc.
Gopalakrishnan, Mohan. (1992). “Tool Requirement Planning and Lot Size Scheduling in Large Time Bucket Settings with Setup Carryover.” PhD Dissertation, Department of Management Science and Statistics, The University of Alabama.
He, Weihua and Andrew Kusiak. (1992). “Scheduling Manufacturing Systems,” Computers in Industry 22(1), 163–175.
Heuts, R.M.J., H.P. Siedel, and W.J. Selen. (1992). “A Comparison of Two Lot Sizing Sequencing Heuristics for the Process Industry,” European Journal of Operational Research 59(1), 413–424.
Hu, T.C., T.S. Kuo, and F. Ruskey. (1987). “Some Optimal Algorithms for Scheduling Problems with Changeover Costs,” Operations Research 39, 94–99.
Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. (1986). The Traveling Salesman Problem. A Wiley-Interscience Publication.
Lee, C.Y. and J.Y. Choi. (1995). “A Genetic Algorithm for Job Sequencing Problems with Distinct Due Dates and General Early-Tardy Penalty Weights,” Computers and Operation Research 22(8), 857–869.
McKinney, Jacqueline. (1980). “Optimal Multi-Product Scheduling on One Machine over a Finite Horizon.” PhD Dissertation, Johns Hopkins University, UMI Dissertation Services.
Ovacik, I.M. and R. Uzsoy. (1994). “Rolling Horizon Algorithms for a Single Machine Dynamic Scheduling Problem with Sequence Dependent Setup Times,” International Journal of Production Research 32(6), 1243–1263.
Pinedo, M. (1995). Scheduling: Theory; Algorithms and Systems. New Jersey: Prentice Hall.
Poon, P.W. and J.N. Carter. (1995). “Genetic Algorithm Crossover Operators for Ordering Applications,” Computers and Operations Research 22(1), 135–147.
Rinooy Kan, A.H.G., B.J. Lageweg, and J.K. Lenstoa. (1975). “Minimizing Total Cost in One Machine Scheduling,” Operations Research 23, 908–927.
Rubin, Paul A. and Gary L. Ragatz. (1995). “Scheduling in Sequence Dependent Setup Environment with Genetic Search,” Computers and Operations Research 22(1), 85–99.
Sahay, Rakesh. (1997). “Scheduling in a Sequence Dependent Setup Time Environment with Setup Carryovers.” Master' Thesis, Department of Industrial Engineering, The University of Alabama.
Sianesi, A., M. Croci, and A. Meroni. (1993). “An Improvement of the LP-Based Aucamp Model for the Solution of Multi-Item Lot-Sizing Capacity-Constrained Problem,” Production Planning and Control 4(3), 223–238.
Smith-Daniels, Vickie L., and Dwight E. Smith-Daniels. (1986). “A Mixed Integer Programming Model for Lot Sizing and Sequencing Packaging Lines in the Process Industry,” IIE Transactions 18(3), 278–285.
Vollman, Thomas E., William L. Berry, and D. Clay Whybark. (1984). Manufacturing and Control Systems. Richard D. Irwin, Inc.
Wagner, H.M. and T.M. Whitin. (1958). “Dynamic Version of the Economic Lot Sizing Model,” Management Science 5(1), 89–96.
White, C.H. and Richard C.Wilson. (1977). “Sequence Dependent SetupTimes and Job Sequencing,” International Journal of Production Research 15(2), 191–202.
Yilmaz, Cengiz. (1981). “A Lot Sizing Technique.” PhD Dissertation, The University of Iowa, UMI Dissertation Services.
Yagiura, M. and T. Ibaraki. (1996). “Metaheuristics as Robust and Simple Optimization Tools,” 1996 IEEE International Conference on Evolutionary Computation. pp. 541–546.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Miller, D.M., Chen, HC., Matson, J. et al. A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem. Journal of Heuristics 5, 437–454 (1999). https://doi.org/10.1023/A:1009684406579
Issue Date:
DOI: https://doi.org/10.1023/A:1009684406579