Abstract
Local search methods have the characteristic of obtaining decent solution with short or acceptable time for job shop scheduling problems. They improve solution by searching iteratively neighbors of initial solution. But, they tend to get trapped in local optimal solutions, usually far away from the global optimal solution. Simulated annealing methods try to improve on this by accepting uphill moves depending on a decreasing probability controlled by the temperature parameter. But, at small temperatures, they also tend to get stuck in valleys of the cost function. In this paper, we proposed an optimization method with large leap steps. The large leap steps of the optimization method allow one to leave these valleys even at small temperatures. Experiments on some job shop scheduling benchmark problems demonstrated the effectiveness and efficiency of the optimization method with large leap steps.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lourenco HRD (1994) A computational study of the job-shop and the flow-shop scheduling problems. Dissertation, Cornell University, pp 80–88
Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl Math 49(1–3):107–127 doi:10.1016/0166-218X(94)90204-6
Chen JS (2006) A branch and bound procedure for the reentrant permutation flow-shop scheduling problem. Int J Adv Manuf Technol 29(11–12):1186–1193 doi:10.1007/s00170-005-0017-x
Chen CH (1996) A lower bound for the correct subset-selection probability and its application to discrete event system simulations. IEEE Trans Automat Contr 41(8):1227–1231 doi:10.1109/9.533692
Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with applications to job-shop scheduling. Manage Sci 38(10):1495–1509
Sun XQ, Noble JS (1999) An approach to job shop scheduling with sequence dependent setups. J Manuf Syst 18(6):416–430 doi:10.1016/S0278-6125(00)87643-8
Kutanoglu E, Sabuncuoglu I (2001) Experimental investigation of iterative simulation-based scheduling in a dynamic and stochastic job shop. J Manuf Syst 20(4):264–279 doi:10.1016/S0278-6125(01)80046-7
Danna E, Perron L (2003) Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. Principles and Practice of Constraint Programming-CP 2003. Proc Lect Notes Comput Sci 2833:817–821
Liu SQ, Ong HL (2004) Metaheuristics for the mixed shop scheduling problem. Asia-Pacific J Oper Res 21(1):97–115 doi:10.1142/S0217595904000072
Mukherjee S, Chatterjee AK (2006) On the representation of the one machine sequencing problem in the shifting bottleneck heuristic. Eur J Oper Res 166:1–5
Dilkina B, Duan L, Havens WS (2005) Extending systematic local search for job shop scheduling problems. Principles and Practice of Constraint Programming-CP 2005. Proc Lect Notes Comput Sci 3709:762–766 doi:10.1007/11564751_60
Kubzin MA, Strusevich VA, Breit J, Schimidt G (2006) Polynomial-time approximation schemes for two-machine open shop scheduling with non-availability constraints. Nav Res Logistics 53(1):16–23 doi:10.1002/nav.20122
Ohta H, Nakatani T (2006) A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs. Int J Prod Econ 101(1):19–29 doi:10.1016/j.ijpe.2005.05.004
Sevkli M, Aydin ME (2006) A variable neighborhood search algorithm for job shop scheduling problems. Evolutionary Computation in Combinatorial Optimization, Proceedings. Lect Notes Comput Sci 3906:261–271 doi:10.1007/11730095_22
Cerny V (1985) Thermo dynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45:41–51 doi:10.1007/BF00940812
Johnson DS, Aragon CR, McGeoch LA, Schevon C (1991) Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper Res 39(3):378–406
Matsuo H, Suh CJ, Sullivan RS (1988) A controlled search simulated annealing method for the general job shop scheduling problem. Technical Report 03-04-88, Dept. of Management, The University of Texas at Austin
Lourenco HR (1995) Job-shop scheduling: computational study of local search and large step optimization methods. Eur J Oper Res 83(2):347–364 doi:10.1016/0377-2217(95)00012-F
Haouari M, Hidri L, Gharbi A (2006) Optimal scheduling of a two-stage hybrid flow shop. Math Methods Oper Res 64(1):107–124 doi:10.1007/s00186-006-0066-4
Lucks VBF (1992) Large-step local optimization for the graph partitioning problem. Masters dissertation, School of OR&IE, Cornell University, Ithaca, NY, USA, January 1992
Breit J (2006) A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint. Comput Oper Res 33(8):2143–2153 doi:10.1016/j.cor.2005.01.004
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Y.M., Yin, H.L., Wang, J. et al. Optimization method with large leap steps for job shop scheduling. Int J Adv Manuf Technol 43, 1018–1023 (2009). https://doi.org/10.1007/s00170-008-1781-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-008-1781-1