Abstract
Although combinatorial algorithms have been designed for problems with given, deterministic data, they are often used to find good, approximate solutions for practical problems in which the input data are stochastic variables. To compensate for the stochasticity, in many cases the stochastic data are replaced, either by some percentile of the distribution, or by the expected value multiplied by a ‘robustness’ factor; the resulting, deterministic instance is then solved, and this solution is run in practice. We apply a different approach based on a combination of local search and simulation. In the local search, the comparison between the current solution and a neighbor is based on simulating both solutions a number of times. Because of the flexibility of simulation, each stochastic variable can have its own probability distribution, and the variables do not have to be independent. We have applied this method to the job shop scheduling problem, where we used simulated annealing as our local search method. It turned out that this method clearly outperformed the traditional rule-of-thumb methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34, 391–401 (1988)
van den Akker, M., Hoogeveen, H.: Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling 11, 59–69 (2008)
Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastical combinatorial optimization. Natural Computing 8, 239–287 (2007)
van Blokland, C.H.M.: Solution Approaches for Solving Stochastic Job Shop and Blocking Job Shop Problems (2012), http://www.staff.science.uu.nl/~3235777/thesis.pdf
ten Eikelder, H.M.M., Aarts, B.J.M., Verhoeven, M.G.A., Aarts, E.H.L.: Sequential and parallel local search algorithms for job shop scheduling. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization, pp. 359–371. Kluwer (1999)
Gonçalves, J.F., de Magalhães Mendes, J.J., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167, 77–95 (2005)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Kammer, M.L., Hoogeveen, J.A., van den Akker, J.M.: Identifying and exploiting commonalities for the job-shop scheduling problem. Computers & Operations Research 38, 1556–1561 (2011)
van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Operations Research 40, 113–125 (1992)
Law, A.M.: Simulation Modeling and Analysis. Mc Graw-Hill (2007)
Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15, 102–109 (1968)
Moraglio, A., ten Eikelder, H., Tadei, R.: Genetic Local Search for Job Shop Scheduling Problem, Technical Report CSM-435, University of Essex, UK (2005)
Niño-Mora, J.: Stochastic scheduling. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopidea of Optimization, pp. 3818–3824 (2008), http://halweb.uc3m.es/jnino/eng/pubs/EoO08.pdf
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science 42, 797–813 (1996)
Pinedo, M.L.: Scheduling Theory, Algorithms and Systems. Prentice Hall (2002)
Pinedo, M.L., Weiss, G.: The largest variance first policy in some stochastic scheduling problems. Operations Research 35, 884–891 (1979)
Rothkopf, M.H.: Scheduling with random service times. Management Science 12, 707–713 (1966)
Roy, B., Sussmann, B.: Les Problèmes d’ordonnancement avec contraintes disjonctives, Note DS no. 9 bis, SEMA, Montrouge (1964)
Schilham, R.M.F.: Commonalities in local search. PhD Thesis, Eindhove University of Technology, The Netherlands (2001)
Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly 3, 59–66 (1956)
Taillard, E.D.: Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6, 108–117 (1994)
Trietsch, D., Baker, K.R.: Minimizing the number of tardy jobs with stochastically-ordered processing times. Journal of Scheduling 11, 71–73 (2008)
Wang, L., Zheng, D.: An effective hybrid optimisation strategy for job-shop scheduling problems. Computers and Operations Research 28, 585–596 (2001)
Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevast’janov, S.V., Shmoys, D.B.: Short shop schedules. Operations Research 45, 288–294 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van den Akker, M., van Blokland, K., Hoogeveen, H. (2013). Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)