{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:53:38Z","timestamp":1768683218432,"version":"3.49.0"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1016\/j.asoc.2017.10.020","type":"journal-article","created":{"date-parts":[[2017,10,17]],"date-time":"2017-10-17T03:31:07Z","timestamp":1508211067000},"page":"259-271","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":50,"special_numbering":"C","title":["A hybrid local-search algorithm for robust job-shop scheduling under scenarios"],"prefix":"10.1016","volume":"62","author":[{"given":"Bing","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaozhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Fengming","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Quanke","family":"Pan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0005","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling: past, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0010","doi-asserted-by":"crossref","first-page":"1448","DOI":"10.1016\/j.asoc.2012.02.024","article-title":"A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion","volume":"13","author":"Zhang","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0015","doi-asserted-by":"crossref","first-page":"4991","DOI":"10.1016\/j.asoc.2011.06.001","article-title":"Simplified multi-objective genetic algorithms for stochastic job shop scheduling","volume":"11","author":"Lei","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0020","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.cor.2009.07.002","article-title":"A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem","volume":"37","author":"Gu","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0025","first-page":"185","article-title":"A hybrid method for solving stochastic job shop scheduling problem","volume":"170","author":"Moghaddam","year":"2005","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0030","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","article-title":"Robust optimization of large-scale systems","volume":"43","author":"Murvey","year":"1995","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/j.asoc.2017.10.020_bib0035","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1080\/07408179408966626","article-title":"Robustness measures and robust scheduling for job shops","volume":"26","author":"Leon","year":"1994","journal-title":"IIE Trans."},{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0040","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/70.681248","article-title":"Decomposition heuristics for robust job-shop scheduling","volume":"14","author":"Byeon","year":"1998","journal-title":"IEEE Trans. Rob. Autom."},{"key":"10.1016\/j.asoc.2017.10.020_bib0045","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S1568-4946(01)00005-9","article-title":"Improving robustness and flexibility of tardiness and total flow time job shops using robustness measures","volume":"1","author":"Jensen","year":"2001","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.asoc.2017.10.020_bib0050","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1002\/nav.20488","article-title":"Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment","volume":"59","author":"Goren","year":"2012","journal-title":"Nav. Res. Logist."},{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0055","doi-asserted-by":"crossref","first-page":"270","DOI":"10.3724\/SP.J.1004.2012.00270","article-title":"Bad-scenario based robust scheduling model","volume":"38","author":"Wang","year":"2012","journal-title":"Acta Autom. Sin."},{"key":"10.1016\/j.asoc.2017.10.020_bib0060","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/978-3-642-03664-4_89","article-title":"Genetic simulated-annealing algorithm for robust job shop scheduling. Fuzzy Information and Engineering, Vol. 2","volume":"62","author":"Wang","year":"2009","journal-title":"Adv. Intell. Soft Comput."},{"issue":"3","key":"10.1016\/j.asoc.2017.10.020_bib0065","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/smj.4250140304","article-title":"Multiple scenario development: its conceptual and behavioral foundation","volume":"14","author":"Schoemaker","year":"1993","journal-title":"Strat. Manage. J."},{"key":"10.1016\/j.asoc.2017.10.020_bib0070","series-title":"Robust Discrete Optimization and Its Application","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0075","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","article-title":"Robust scheduling to hedge against processing time uncertainty in single-stage production","volume":"41","author":"Daniels","year":"1995","journal-title":"Manage. Sci."},{"key":"10.1016\/j.asoc.2017.10.020_bib0080","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.asoc.2014.06.006","article-title":"Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times","volume":"23","author":"Lu","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0085","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1080\/07408170008963918","article-title":"Robust scheduling of a two-machine flow shop with uncertain processing times","volume":"32","author":"Kouvelis","year":"2000","journal-title":"IIE Trans."},{"issue":"11","key":"10.1016\/j.asoc.2017.10.020_bib0090","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1080\/07408179708966416","article-title":"Beta-scheduling for single-machine systems with uncertain processing times","volume":"29","author":"Daniels","year":"1997","journal-title":"IIE Trans."},{"issue":"6","key":"10.1016\/j.asoc.2017.10.020_bib0095","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1016\/j.cor.2006.10.013","article-title":"Scenario relaxation algorithm for finite scenario-based min\u2013max regret and min\u2013max relative regret robust optimization","volume":"35","author":"Assavapokee","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0100","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10951-006-0326-4","article-title":"Robust optimization models for project scheduling with resource availability cost","volume":"10","author":"Yamashita","year":"2007","journal-title":"J. Scheduling"},{"key":"10.1016\/j.asoc.2017.10.020_bib0105","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1013333232691","article-title":"On the robust single machine scheduling problem","volume":"6","author":"Yang","year":"2002","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.asoc.2017.10.020_bib0110","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","article-title":"Approximating a two-machine flow shop scheduling under discrete scenario uncertainty","volume":"217","author":"Kasperski","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0115","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2012.01.056","article-title":"Lexicographic a-robustness: an alternative to min\u2013max criteria","volume":"220","author":"Kalai","year":"2012","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"10.1016\/j.asoc.2017.10.020_bib0120","doi-asserted-by":"crossref","first-page":"4148","DOI":"10.1021\/ie071431u","article-title":"Robust optimization for process scheduling under uncertainty","volume":"47","author":"Li","year":"2008","journal-title":"Ind. Eng. Chem. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0125","series-title":"Robust Optimization","author":"Ben-Tal","year":"2009"},{"key":"10.1016\/j.asoc.2017.10.020_bib0130","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Min-max and min-max regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0135","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1080\/09511920802209033","article-title":"Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research","volume":"22","author":"Sabuncuoglu","year":"2009","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"10.1016\/j.asoc.2017.10.020_bib0140","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","article-title":"Recent advances in robust optimization: an overview","volume":"235","author":"Gabrel","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0145","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1016\/j.asoc.2012.07.033","article-title":"An AIS-based hybrid algorithm with PDRs for multi-objective dynamic online job shop scheduling problem","volume":"13","author":"Qiu","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0150","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1016\/j.asoc.2012.03.025","article-title":"Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling","volume":"12","author":"Lei","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0155","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1016\/S0305-0548(03)00197-7","article-title":"Adaptive temperature control for simulated annealing: a comparative study","volume":"31","author":"Azizi","year":"2004","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"10.1016\/j.asoc.2017.10.020_bib0160","doi-asserted-by":"crossref","first-page":"5782","DOI":"10.1016\/j.asoc.2011.01.046","article-title":"Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm","volume":"11","author":"Yusof","year":"2011","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.asoc.2017.10.020_bib0165","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","article-title":"A hybrid genetic algorithm for the job shop scheduling problem","volume":"167","author":"Goncalves","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0170","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","article-title":"A very fast TS\/SA algorithm for the job shop scheduling problem","volume":"35","author":"Zhang","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0175","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.asoc.2012.07.034","article-title":"A hybrid differential evolution-tabu search algorithm for the solution of job-shop scheduling problems","volume":"13","author":"Ponsich","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0180","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1007\/s00170-008-1404-x","article-title":"Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems","volume":"40","author":"Eswaramurthy","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2017.10.020_bib0185","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1016\/j.cie.2011.12.018","article-title":"A GES\/TS algorithm for the job shop scheduling","volume":"62","author":"Nasiri","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2017.10.020_bib0190","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","article-title":"An effective hybrid optimization strategy for job-shop scheduling problems","volume":"28","author":"Wang","year":"2001","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.020_bib0195","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.asoc.2009.06.008","article-title":"Hybrid immune simulated annealing algorithm for the job shop scheduling problem","volume":"10","author":"Zhang","year":"2010","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0200","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.asoc.2015.05.004","article-title":"Memetic algorithms for the job shop scheduling problem with operators","volume":"34","author":"Mencia","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0205","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1016\/j.asoc.2012.03.073","article-title":"Wang Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm","volume":"13","author":"R.Qing-dao-er-ji","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0210","doi-asserted-by":"crossref","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","article-title":"A hybrid harmony search algorithm for the flexible job shop scheduling problem","volume":"13","author":"Yuan","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.020_bib0215","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.asoc.2015.11.034","article-title":"Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling","volume":"40","author":"Rifai","year":"2016","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.asoc.2017.10.020_bib0220","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"Van Laarhoven","year":"1992","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0225","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","article-title":"Parallel Taboo Search techniques for the job shop scheduling problem","volume":"6","author":"Taillard","year":"1994","journal-title":"ORSA J. Comput."},{"issue":"6","key":"10.1016\/j.asoc.2017.10.020_bib0230","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Manage. Sci."},{"issue":"2","key":"10.1016\/j.asoc.2017.10.020_bib0235","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","article-title":"An advanced Tabu Search algorithm for the job shop problem","volume":"8","author":"Nowicki","year":"2005","journal-title":"J. Scheduling"},{"key":"10.1016\/j.asoc.2017.10.020_bib0240","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","article-title":"Computational complexity of discrete optimization problems","volume":"4","author":"Lenstra","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.asoc.2017.10.020_bib0245","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Math. OR"},{"key":"10.1016\/j.asoc.2017.10.020_bib0250","series-title":"Industrial Scheduling","author":"Muth","year":"1963"},{"key":"10.1016\/j.asoc.2017.10.020_bib0255","series-title":"Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Graduate School of Industrial Administration","author":"Lawrence","year":"1984"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617306257?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617306257?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T15:47:01Z","timestamp":1570204021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494617306257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":51,"alternative-id":["S1568494617306257"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2017.10.020","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A hybrid local-search algorithm for robust job-shop scheduling under scenarios","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2017.10.020","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}