{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:41:19Z","timestamp":1757544079363},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_35","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"402-413","source":"Crossref","is-referenced-by-count":6,"title":["Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search"],"prefix":"10.1007","author":[{"given":"Marjan","family":"van den Akker","sequence":"first","affiliation":[]},{"given":"Kevin","family":"van Blokland","sequence":"additional","affiliation":[]},{"given":"Han","family":"Hoogeveen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science\u00a034, 391\u2013401 (1988)","journal-title":"Management Science"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10951-007-0034-8","volume":"11","author":"M. Akker van den","year":"2008","unstructured":"van den Akker, M., Hoogeveen, H.: Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling\u00a011, 59\u201369 (2008)","journal-title":"Journal of Scheduling"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L. Bianchi","year":"2007","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastical combinatorial optimization. Natural Computing\u00a08, 239\u2013287 (2007)","journal-title":"Natural Computing"},{"key":"35_CR4","unstructured":"van Blokland, C.H.M.: Solution Approaches for Solving Stochastic Job Shop and Blocking Job Shop Problems (2012), \n                    \n                      http:\/\/www.staff.science.uu.nl\/~3235777\/thesis.pdf"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013371. Kluwer (1999)","DOI":"10.1007\/978-1-4615-5775-3_25"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"J.F. Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves, J.F., de Magalh\u00e3es Mendes, J.J., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research\u00a0167, 77\u201395 (2005)","journal-title":"European Journal of Operational Research"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"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\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.cor.2011.01.014","volume":"38","author":"M.L. Kammer","year":"2011","unstructured":"Kammer, M.L., Hoogeveen, J.A., van den Akker, J.M.: Identifying and exploiting commonalities for the job-shop scheduling problem. Computers & Operations Research\u00a038, 1556\u20131561 (2011)","journal-title":"Computers & Operations Research"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Laarhoven van","year":"1992","unstructured":"van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job shop scheduling by simulated annealing. Operations Research\u00a040, 113\u2013125 (1992)","journal-title":"Operations Research"},{"key":"35_CR10","unstructured":"Law, A.M.: Simulation Modeling and Analysis. Mc Graw-Hill (2007)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J.M. Moore","year":"1968","unstructured":"Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science\u00a015, 102\u2013109 (1968)","journal-title":"Management Science"},{"key":"35_CR12","unstructured":"Moraglio, A., ten Eikelder, H., Tadei, R.: Genetic Local Search for Job Shop Scheduling Problem, Technical Report CSM-435, University of Essex, UK (2005)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Ni\u00f1o-Mora, J.: Stochastic scheduling. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopidea of Optimization, pp. 3818\u20133824 (2008), \n                    \n                      http:\/\/halweb.uc3m.es\/jnino\/eng\/pubs\/EoO08.pdf","DOI":"10.1007\/978-0-387-74759-0_665"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science\u00a042, 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"35_CR15","unstructured":"Pinedo, M.L.: Scheduling Theory, Algorithms and Systems. Prentice Hall (2002)"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1287\/opre.35.6.884","volume":"35","author":"M.L. Pinedo","year":"1979","unstructured":"Pinedo, M.L., Weiss, G.: The largest variance first policy in some stochastic scheduling problems. Operations Research\u00a035, 884\u2013891 (1979)","journal-title":"Operations Research"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1287\/mnsc.12.9.707","volume":"12","author":"M.H. Rothkopf","year":"1966","unstructured":"Rothkopf, M.H.: Scheduling with random service times. Management Science\u00a012, 707\u2013713 (1966)","journal-title":"Management Science"},{"key":"35_CR18","unstructured":"Roy, B., Sussmann, B.: Les Probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives, Note DS no. 9 bis, SEMA, Montrouge (1964)"},{"key":"35_CR19","unstructured":"Schilham, R.M.F.: Commonalities in local search. PhD Thesis, Eindhove University of Technology, The Netherlands (2001)"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly 3, 59\u201366 (1956)","journal-title":"Naval Research Logistics Quarterly"},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E.D. Taillard","year":"1994","unstructured":"Taillard, E.D.: Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing\u00a06, 108\u2013117 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"35_CR22","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10951-007-0022-z","volume":"11","author":"D. Trietsch","year":"2008","unstructured":"Trietsch, D., Baker, K.R.: Minimizing the number of tardy jobs with stochastically-ordered processing times. Journal of Scheduling\u00a011, 71\u201373 (2008)","journal-title":"Journal of Scheduling"},{"key":"35_CR23","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L. Wang","year":"2001","unstructured":"Wang, L., Zheng, D.: An effective hybrid optimisation strategy for job-shop scheduling problems. Computers and Operations Research\u00a028, 585\u2013596 (2001)","journal-title":"Computers and Operations Research"},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D.P. Williamson","year":"1997","unstructured":"Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevast\u2019janov, S.V., Shmoys, D.B.: Short shop schedules. Operations Research\u00a045, 288\u2013294 (1997)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:19:44Z","timestamp":1557703184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}