{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T15:29:42Z","timestamp":1750433382400,"version":"3.37.3"},"reference-count":33,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T00:00:00Z","timestamp":1660780800000},"content-version":"vor","delay-in-days":48,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,7,13]]},"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>This paper proposes exact algorithms to generate optimal timing schedules for a given sequence of operations in job shops to minimize the total weighted earliness and tardiness. The algorithms are proposed for two job shop scheduling scenarios, one involving due dates only for the last operation of each job and the other involving due dates for all operations on all the jobs. Computational experiments on benchmark problem instances reveal that, in the case of the scheduling scenario involving due dates only for the last operation of each job, the proposed exact algorithms generate schedules faster than those generated using a popular optimization solver. In the case of the scheduling scenario involving due dates for all operations on all the jobs, the exact algorithms are competitive with the optimization solver in terms of computation time for small and medium size problems.<\/jats:p>","DOI":"10.1051\/ro\/2022124","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T18:53:15Z","timestamp":1658343195000},"page":"2621-2649","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing the total weighted earliness and tardiness for a sequence of operations in job shops"],"prefix":"10.1051","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8581-4198","authenticated-orcid":false,"given":"Baby Sivanandan","family":"Girish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Habibullah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jessamma","family":"Dileeplal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2022,8,18]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1287\/mnsc.26.12.1227","volume":"26","author":"Adam","year":"1980","journal-title":"Manage. Sci."},{"key":"R2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10732-020-09458-6","volume":"27","author":"Ahmadian","year":"2021","journal-title":"J. Heuristics"},{"key":"R3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2020.04.017","volume":"288","author":"Ahmadian","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Araujo R.P., dos Santos A.G. and Arroyo J.E.C., Genetic Algorithm and Local Search for Just-in-Time Job-Shop Scheduling. In: Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC 2009) (2009) 955\u2013961.","DOI":"10.1109\/CEC.2009.4983048"},{"key":"R5","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.cor.2006.05.009","volume":"35","author":"Baptiste","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"R6","doi-asserted-by":"crossref","first-page":"3219","DOI":"10.1016\/j.cor.2005.02.037","volume":"33","author":"Bauman","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"Beck","year":"2003","journal-title":"Ann. Oper. Res."},{"key":"R8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"Blackstone","year":"1982","journal-title":"Int. J. Prod. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1080\/09537280110069630","volume":"13","author":"Croce","year":"2002","journal-title":"Prod. Plan. Control."},{"key":"R10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1051\/ro:2001110","volume":"35","author":"Chretienne","year":"2001","journal-title":"RAIRO-Oper. Res."},{"key":"R11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0304-3975(01)00220-1","volume":"292","author":"Chretienne","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"R12","unstructured":"Cleveland T., Number Theory. Ed-Tech Press (2020)."},{"key":"R13","unstructured":"Danna E., Rothberg E. and Pape C.L., Integrating mixed integer programming and local search: A case on Job-shop scheduling problems. In: Proceedings of the Fifth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CPAIOR\u201903) (2003) 65\u201379."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"dos Santos A.G., Araujo R.P. and Arroyo J.E.C., A combination of evolutionary algorithm, mathematical programming, and a new local search procedure for the just-in-time job-shop scheduling problem. In: Vol. 6073 of Learning and Intelligent Optimization (LION 2010), edited by Blum C. and Battiti R., Lecture Notes in Computer Science, Springer-Verlag, Berlin- Heidelberg (2010) 10\u201324.","DOI":"10.1007\/978-3-642-13800-3_2"},{"key":"R15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10479-007-0284-z","volume":"159","author":"Feng","year":"2008","journal-title":"Ann. Oper. Res."},{"key":"R16","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"Garey","year":"1988","journal-title":"Math. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"Giffler","year":"1960","journal-title":"Oper. Res."},{"key":"R18","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.asoc.2016.04.011","volume":"44","author":"Girish","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"R19","doi-asserted-by":"crossref","first-page":"2931","DOI":"10.1016\/j.cor.2005.11.004","volume":"34","author":"Hendel","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"R20","unstructured":"IBM software, IBM ILOG CPLEX Optimization Studio CPLEX User\u2019s Manual version 12 Release 8, IBM, 2017. Available online: https:\/\/www.ibm.com\/support\/pages\/introduction-concert-technology."},{"key":"R21","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"Jain","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"J\u00f3zefowska J., Just-in-time concept in manufacturing and computer systems, In: Just-In-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems, Vol. 106 of International Series In Operations Research,Springer, Boston (2007) 1\u201323.","DOI":"10.1007\/978-0-387-71718-0"},{"key":"R23","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s10845-009-0318-2","volume":"22","author":"Kelbel","year":"2011","journal-title":"J. Intell. Manuf."},{"key":"R24","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0305-0548(94)00073-H","volume":"22","author":"Lee","year":"1995","journal-title":"Comput. Oper. Res."},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Monette J., Deville Y. and Hentenryck P.V., Just-in-time scheduling with constraint programming. In: Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 2009) (2009) 241\u2013248.","DOI":"10.1609\/icaps.v19i1.13356"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Ponnambalam S.G., Jawahar N. and Girish B.S., Giffler and Thompson procedure based genetic algorithms for scheduling job shops, In: Computational intelligence of flow shop and job shop scheduling, In Vol. 230 of Studies in Computational Intelligence, Springer-Verlag, Berlin-Heidelberg (2010) 229\u2013259.","DOI":"10.1007\/978-3-642-02836-6_8"},{"key":"R27","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1002\/1520-6750(199510)42:7<1109::AID-NAV3220420709>3.0.CO;2-5","volume":"42","author":"Szwarc","year":"1995","journal-title":"Nav. Res. Logist."},{"key":"R28","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1010958200070","volume":"102","author":"Vanhoucke","year":"2001","journal-title":"Ann. Oper. Res."},{"key":"R29","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0377-2217(01)00302-2","volume":"142","author":"Wan","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"R30","first-page":"1","volume":"2014","author":"Wang","year":"2014","journal-title":"Math. Probl. Eng."},{"key":"R31","first-page":"2462","volume":"472\u2013475","author":"Yang","year":"2012","journal-title":"Adv. Mat. Res."},{"key":"R32","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s00170-011-3746-z","volume":"61","author":"Yang","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R33","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","volume":"30","author":"Zhang","year":"2019","journal-title":"J. Intell. Manuf."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022124\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T05:20:43Z","timestamp":1676179243000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":33,"journal-issue":{"issue":"4"},"alternative-id":["ro220046"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022124","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}