{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T22:15:25Z","timestamp":1771539325126,"version":"3.50.1"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T00:00:00Z","timestamp":1645142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Spanish Government","award":["PID2019-106263RB-I00"],"award-info":[{"award-number":["PID2019-106263RB-I00"]}]},{"name":"Spanish Government","award":["TIN2017-87600-P"],"award-info":[{"award-number":["TIN2017-87600-P"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,3,30]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper addresses a variant of the job shop scheduling problem with total tardiness minimization where task durations and due dates are uncertain. This uncertainty is modelled with intervals. Different ranking methods for intervals are considered and embedded into a genetic algorithm. A new robustness measure is proposed to compare the different ranking methods and assess their capacity to predict \u2018expected delays\u2019 of jobs. Experimental results show that dealing with uncertainty during the optimization process yields more robust solutions. A sensitivity analysis also shows that the robustness of the solutions given by the solving method increases when the uncertainty grows.<\/jats:p>","DOI":"10.1093\/jigpal\/jzac016","type":"journal-article","created":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T20:14:25Z","timestamp":1643141665000},"page":"240-254","source":"Crossref","is-referenced-by-count":8,"title":["Robust schedules for tardiness optimization in job shop with interval uncertainty"],"prefix":"10.1093","volume":"31","author":[{"given":"Hern\u00e1n","family":"D\u00edaz","sequence":"first","affiliation":[{"name":"Department of Computing, University of Oviedo , 33204, Gij\u00f3n, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Jos\u00e9","family":"Palacios","sequence":"additional","affiliation":[{"name":"Department of Computing, University of Oviedo , 33204, Gij\u00f3n, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"D\u00edaz","sequence":"additional","affiliation":[{"name":"Department of Computing, University of Oviedo , 33204, Gij\u00f3n, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camino R","family":"Vela","sequence":"additional","affiliation":[{"name":"Department of Computing, University of Oviedo , 33204, Gij\u00f3n, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"In\u00e9s","family":"Gonz\u00e1lez-Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"Department of Maths, Stats and Computing , University of Cantabria, 39005, Santander, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,2,18]]},"reference":[{"key":"2023033115514111800_","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":"European Journal of Operational Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cor.2014.06.003","article-title":"Single machine scheduling problem with interval processing times to minimize mean weighted completion time","volume":"51","author":"Allahverdi","year":"2014","journal-title":"Computers & Operations Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"9270802","DOI":"10.1155\/2018\/9270802","article-title":"Recent research trends in genetic algorithm based flexible job shop scheduling problems","volume":"2018","author":"Amjad","year":"2018","journal-title":"Mathematical Problems in Engineering"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2003.08.027","article-title":"Executing production schedules in the face of uncertainties: A review and some future directions","volume":"161","author":"Aytung","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10700-015-9225-5","article-title":"Survey on fuzzy shop scheduling","volume":"15","author":"Behnamian","year":"2016","journal-title":"Fuzzy Optimization and Decision Making"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01719250","article-title":"A generalized permutation approach to jobshop scheduling with genetic algorithms","volume":"17","author":"Bierwirth","year":"1995","journal-title":"OR Spectrum"},{"key":"2023033115514111800_","first-page":"657","article-title":"M\u00e9moire sur les \u00e9lections au scrutin","author":"Borda","year":"1784","journal-title":"Histoire de l\u2019Academie Royale des Sciences (Jg. 1781)"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.fss.2012.07.015","article-title":"Generation of linear orders for intervals by means of aggregation functions","volume":"220","author":"Bustince","year":"2013","journal-title":"Fuzzy Sets and Systems"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","article-title":"A research survey: Review of AI solution strategies of job shop scheduling problem","volume":"26","author":"\u00c7ali\u015f","year":"2015","journal-title":"Journal of Intelligent Manufacturing"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0377-2217(02)00561-1","article-title":"On two single machine scheduling problems with fuzzy processing times and fuzzy due dates","volume":"147","author":"Chanas","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-3-030-61705-9_18","article-title":"Tardiness minimisation for job shop scheduling with interval uncertainty","volume-title":"Hybrid Artificial Intelligent Systems","author":"D\u00edaz","year":"2020"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/3468.487961","article-title":"Representing partial ignorance","volume":"26","author":"Dubois","year":"1996","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part A"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0377-2217(02)00558-1","article-title":"Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge","volume":"147","author":"Dubois","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","article-title":"A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem","volume":"35","author":"Essafi","year":"2008","journal-title":"Computers & Operations Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10951-010-0163-3","article-title":"Criticality analysis of activity networks under interval uncertainty","volume":"13","author":"Fortin","year":"2010","journal-title":"Journal of Scheduling"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s11047-011-9300-y","article-title":"A competent memetic algorithm for complex scheduling","volume":"11","author":"Gonz\u00e1lez","year":"2012","journal-title":"Natural Computing"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/TSMCA.2008.918603","article-title":"Semantics of schedules for the fuzzy job shop problem","volume":"38","author":"Gonz\u00e1lez Rodr\u00edguez","year":"2008","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part A"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1093\/jigpal\/jzaa037","article-title":"A modified biogeography-based optimization algorithm with improved mutation operator for job shop scheduling problem with time lags","volume":"29","author":"Harrabi","year":"2020","journal-title":"Logic Journal of IGPL"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2012.01.056","article-title":"Lexicographic $\\alpha $-robustness: An alternative to min-max criteria","volume":"220","author":"Kala\u00ef","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"2023033115514111800_","first-page":"38","article-title":"A comparative study of different order relations of intervals","volume":"16","author":"Karmakar","year":"2012","journal-title":"Reliable Computing"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: Past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimedia Tools and Applications"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1016\/j.cie.2011.07.010","article-title":"Population-based neighborhood search for job shop scheduling with interval processing time","volume":"61","author":"Lei","year":"2011","journal-title":"Computers & Industrial Engineering"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00170-011-3600-3","article-title":"Interval job shop scheduling problems","volume":"60","author":"Lei","year":"2012","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1007\/s00170-012-4463-y","article-title":"Multi-objective artificial bee colony for interval job shop scheduling with flexible maintenance","volume":"66","author":"Lei","year":"2013","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1016\/j.cie.2019.04.028","article-title":"Particle swarm optimization hybridized with genetic algorithm for uncertain integrated process planning and scheduling with interval processing time","volume":"235","author":"Li","year":"2019","journal-title":"Computers & Industrial Engineering"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1093\/jigpal\/jzx048","article-title":"An evolutionary scheduling approach for trading-off accuracy vs. verifiable energy in multicore processors","volume":"25","author":"Liqat","year":"2017","journal-title":"Logic Journal of the IGPL"},{"key":"2023033115514111800_","first-page":"79","article-title":"Multi-factory job shop scheduling with due date objective","volume-title":"Proceedings of the 2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","author":"Lohmer","year":"2020"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"Moore","year":"2009"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10586-016-0717-z","article-title":"Multi-objective inverse scheduling optimization of single-machine shop system with uncertain due-dates and processing times","volume":"20","author":"Mou","year":"2017","journal-title":"Cluster Computing"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cor.2014.08.023","article-title":"Genetic tabu search for the fuzzy flexible job shop problem","volume":"54","author":"Palacios","year":"2015","journal-title":"Computers & Operations Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s11047-014-9413-1","article-title":"Robust swarm optimisation for fuzzy open shop scheduling","volume":"13","author":"Palacios","year":"2014","journal-title":"Natural Computing"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.fss.2014.12.003","article-title":"Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop","volume":"278","author":"Palacios","year":"2015","journal-title":"Fuzzy Sets and Systems"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"2016"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"5099","DOI":"10.1007\/s00500-018-3177-y","article-title":"Extended genetic algorithm for solving open-shop scheduling problem","volume":"23","author":"Rahmani Hosseinabadi","year":"2019","journal-title":"Soft Computing"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.ejor.2008.12.036","article-title":"Robustness in operational research and decision aiding: A multi-faceted issue","volume":"200","author":"Roy","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"104931","DOI":"10.1016\/j.cor.2020.104931","article-title":"Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling","volume":"119","author":"Vela","year":"2020","journal-title":"Computers & Operations Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1080\/03081070600574353","article-title":"Some geometric aggregation operators based on intuitionistic fuzzy sets","volume":"35","author":"Xu","year":"2006","journal-title":"International Journal of General Systems"},{"key":"2023033115514111800_","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":"Computers & Operations Research"},{"key":"2023033115514111800_","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","article-title":"Review of job shop scheduling research and its new perspectives under industry 4.0","volume":"30","author":"Zhang","year":"2019","journal-title":"Journal of Intelligent Manufacturing"}],"container-title":["Logic Journal of the IGPL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/31\/2\/240\/49705904\/jzac016.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/31\/2\/240\/49705904\/jzac016.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T08:03:25Z","timestamp":1700121805000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article\/31\/2\/240\/6530596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,18]]},"references-count":40,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,2,18]]},"published-print":{"date-parts":[[2023,3,30]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/jzac016","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,4]]},"published":{"date-parts":[[2022,2,18]]}}}