{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:35:18Z","timestamp":1775745318688,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T00:00:00Z","timestamp":1518739200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T00:00:00Z","timestamp":1518739200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100003550","name":"AAA Foundation for Traffic Safety","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100003550","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12351-018-0384-3","type":"journal-article","created":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T09:11:00Z","timestamp":1518772260000},"page":"1763-1789","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm"],"prefix":"10.1007","volume":"20","author":[{"given":"Asmaa","family":"Khoudi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Berrichi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,16]]},"reference":[{"key":"384_CR1","doi-asserted-by":"crossref","unstructured":"Basseur M, Lemesre J, Dhaenens C, Talbi, E-G (2004) Cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem. Workshop on experimental and efficient algorithms (WEA\"04), Rio de Janeiro, Brazil, pp 72\u201386","DOI":"10.1007\/978-3-540-24838-5_6"},{"key":"384_CR2","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1007\/s00170-013-4841-0","volume":"68","author":"A Berrichi","year":"2013","unstructured":"Berrichi A, Yalaoui F (2013) Efficient bi-objective ant colony approach to minimize total tardiness and system unavailability for a parallel machine scheduling problem. Int J Adv Manuf Technol 68:2295\u20132310","journal-title":"Int J Adv Manuf Technol"},{"key":"384_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10845-008-0113-5","volume":"20","author":"A Berrichi","year":"2009","unstructured":"Berrichi A, Amodeo L, Yalaoui F, Ch\u00e2telet E, Mezeghiche M (2009) Bi-objective optimization algorithms for joint production and maintenance scheduling. Application to the parallel machine problem. J Intell Manuf 20:389\u2013400","journal-title":"J Intell Manuf"},{"issue":"9","key":"384_CR4","doi-asserted-by":"publisher","first-page":"1584","DOI":"10.1016\/j.cor.2009.11.017","volume":"37","author":"A Berrichi","year":"2010","unstructured":"Berrichi A, Amodeo L, Yalaoui F, Mezghiche M (2010) Bi-objective ant colony optimization approach to optimize production and maintenance scheduling. Comput Oper Res 37(9):1584\u20131596","journal-title":"Comput Oper Res"},{"key":"384_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/07408170304416","volume":"35","author":"CR Cassady","year":"2003","unstructured":"Cassady CR, Kutanoglu E (2003) Minimizing job tardiness using integrated preventive maintenance planning and production scheduling. IIE Trans 35:503\u2013513","journal-title":"IIE Trans"},{"issue":"2","key":"384_CR6","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1109\/TR.2005.845967","volume":"54","author":"CR Cassady","year":"2005","unstructured":"Cassady CR, Kutanoglu E (2005) Integrating preventive maintenance planning and production scheduling for a single machine. IEEE Trans Reliab 54(2):304\u2013309","journal-title":"IEEE Trans Reliab"},{"issue":"3","key":"384_CR8","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.omega.2008.01.001","volume":"37","author":"WJ Chen","year":"2009","unstructured":"Chen WJ (2009) Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega 37(3):591\u2013599","journal-title":"Omega"},{"issue":"2","key":"384_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolut Comput"},{"key":"384_CR10","volume-title":"An introduction to reliability and maintainability engineering","author":"CE Ebeling","year":"1979","unstructured":"Ebeling CE (1979) An introduction to reliability and maintainability engineering. McGraw_Hill, New York"},{"key":"384_CR11","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott M, Gandibleux X (2007) Bounds sets for biobjective combinatorial optimization problems. Comput Oper Res 34:2674\u20132694","journal-title":"Comput Oper Res"},{"key":"384_CR12","series-title":"International series in operations research & management science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-1-4939-3094-4_19","volume-title":"Multiple criteria decision analysis","author":"M Ehrgott","year":"2016","unstructured":"Ehrgott M, Gandibleux X, Przybylski A (2016) Exact Methods for Multi-Objective combinatorial optimization. In: Greco S, Ehrgott M, Figueira JR (eds) Multiple criteria decision analysis, vol 233. International series in operations research & management science. Springer, New York, pp 817\u2013850"},{"key":"384_CR13","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ijpe.2011.12.021","volume":"136","author":"M-C Fitouhi","year":"2012","unstructured":"Fitouhi M-C, Nourelfath M (2012) Integrating noncyclical preventive maintenance scheduling and production planning for single machine. Int J Prod Econ 136:344\u2013351","journal-title":"Int J Prod Econ"},{"key":"384_CR14","unstructured":"Kaabi J (2004) Contribution \u00e0 l\u2019ordonnancement des activit\u00e9s de maintenance dans les syst\u00e8mes de production. Th\u00e8se de doctorat, Universit\u00e9 de Franche-Comt\u00e9"},{"key":"384_CR15","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ijpe.2007.01.013","volume":"112","author":"I Kacem","year":"2008","unstructured":"Kacem I, Chu C (2008) Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on single machine with one unavailability constraint. Int J Prod Econ 112:138\u2013150","journal-title":"Int J Prod Econ"},{"key":"384_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.04.007","volume":"20","author":"C Koulamas","year":"2010","unstructured":"Koulamas C (2010) The single-machine total tardiness scheduling problem: review and extensions. Eur J Oper Res 20:1\u20137","journal-title":"Eur J Oper Res"},{"key":"384_CR17","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/S0305-0548(02)00074-6","volume":"30","author":"CJ Liao","year":"2003","unstructured":"Liao CJ, Chen WJ (2003) Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput Oper Res 30:1335\u20131347","journal-title":"Comput Oper Res"},{"key":"384_CR18","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2017.1280258","author":"W Liao","year":"2017","unstructured":"Liao W, Zhang X, Jiang M (2017) Multi-objective goup scheduling optimization integrated with preventive maintenance. Eng Optim. \n                  https:\/\/doi.org\/10.1080\/0305215X.2017.1280258","journal-title":"Eng Optim"},{"key":"384_CR104","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10732-009-9103-9","volume":"16","author":"T Lust","year":"2010","unstructured":"Lust T, Teghem J (2010) Two-phase Pareto local search for the bi-objective traveling salesman problem. J Heuristics 16:475\u2013510","journal-title":"J Heuristics"},{"issue":"3","key":"384_CR102","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/S0377-2217(97)00077-5","volume":"107","author":"G Mavrotas","year":"1998","unstructured":"Mavrotas G, Diakoulaki D (1998) A branch and bound algorithm for mixed zero-one multiple objective linear programming. Eur J Operational Res 107(3):530\u2013541","journal-title":"Eur J Operational Res"},{"key":"384_CR19","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s00170-010-2666-7","volume":"51","author":"E Moradi","year":"2010","unstructured":"Moradi E, Zandieh M (2010) Minimizing the makespan and the system unavailability in parallel machine scheduling problem: a similarity-based genetic algorithm. Int J Adv Manuf Technol 51:829\u2013840","journal-title":"Int J Adv Manuf Technol"},{"key":"384_CR20","doi-asserted-by":"publisher","first-page":"7169","DOI":"10.1016\/j.eswa.2010.12.043","volume":"38","author":"E Moradi","year":"2011","unstructured":"Moradi E, Ghomi Fatemi SMT, Zandieh M (2011) Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem. Expert Syst Appl 38:7169\u20137178","journal-title":"Expert Syst Appl"},{"key":"384_CR21","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1057\/jors.2009.5","volume":"61","author":"G Moshieov","year":"2010","unstructured":"Moshieov G, Sidney JB (2010) Scheduling a deteriorating maintenance activity on a single machine. J Oper Res Soc 61:882\u2013887","journal-title":"J Oper Res Soc"},{"key":"384_CR22","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2008","unstructured":"Pinedo ML (2008) Scheduling: theory, algorithms, and systems. Springer, New York"},{"key":"384_CR24","doi-asserted-by":"publisher","first-page":"3314","DOI":"10.1016\/j.cor.2005.12.007","volume":"34","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, Garcia-Diaz JC, Maroto C (2007) Concepcion considering scheduling and preventive maintenance in the flowshop sequencing problem. Comput Oper Res 34:3314\u20133330","journal-title":"Comput Oper Res"},{"key":"384_CR25","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.cie.2008.03.005","volume":"55","author":"M Sbihi","year":"2008","unstructured":"Sbihi M, Varnier C (2008) Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness. Comput Ind Eng 55:830\u2013840","journal-title":"Comput Ind Eng"},{"key":"384_CR105","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2008.07.005","volume":"197","author":"J Schaller","year":"2009","unstructured":"Schaller J (2009) Note on Shim and Kim\u2019s lower bounds for scheduling on identical parallel machines to minimize total tardiness. Eur J Operational Res 197:422\u2013426","journal-title":"Eur J Operational Res"},{"key":"384_CR26","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1057\/palgrave.jors.2602141","volume":"58","author":"SO Shim","year":"2007","unstructured":"Shim SO, Kim YD (2007a) Minimizing total tardiness in an unrelated parallel-machine scheduling problem. J Oper Res Soc 58:346\u2013354","journal-title":"J Oper Res Soc"},{"key":"384_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ejor.2005.09.038","volume":"177","author":"S-O Shim","year":"2007","unstructured":"Shim S-O, Kim Y-D (2007b) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177:135\u2013146","journal-title":"Eur J Oper Res"},{"key":"384_CR28","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F Sourd","year":"2008","unstructured":"Sourd F, Spanjaard O (2008) A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J Comp 20:472\u2013484","journal-title":"INFORMS J Comp"},{"key":"384_CR103","unstructured":"Villemeur A (1991) Reliability, availability, maintainability and safety assessment. Wiley, USA"},{"key":"384_CR29","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2012.08.003","volume":"40","author":"T Vincent","year":"2013","unstructured":"Vincent T, Seipp F, Ruzika S, Przybylski A, Gandibleux X (2013) Multiple objective branch and bound for mixed 0-1 linear programming. Corrections and improvements for the biobjective case. Comput Oper Res 40:498\u2013509","journal-title":"Comput Oper Res"},{"key":"384_CR30","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M Visee","year":"1998","unstructured":"Visee M, Teghem J, Pirlot M, Ulungu EL (1998) Two-phases method and branch and bound procedures to solve the bi\u2013objective knapsack problem. J Global Optim 12:139\u2013155","journal-title":"J Global Optim"},{"issue":"3","key":"384_CR31","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1080\/00207543.2012.676683","volume":"51","author":"S Wang","year":"2013","unstructured":"Wang S, Liu M (2013) A branch and bound algorithm for single machine production scheduling integrated with preventive maintenance planning. Int J Prod Res 51(3):847\u2013868","journal-title":"Int J Prod Res"},{"key":"384_CR32","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cor.2010.09.003","volume":"38","author":"S-L Yang","year":"2011","unstructured":"Yang S-L, Ma Y, Xu D-L, Yang J-B (2011) Minimizing total completion time on a single machine with a flexible maintenance activity. Comput Oper Res 38:755\u2013770","journal-title":"Comput Oper Res"},{"key":"384_CR33","first-page":"46","volume":"4","author":"M Yazdani","year":"2017","unstructured":"Yazdani M, Khalili SM, Babagolzadeh M, Jolai F (2017) A single-machine scheduling problem with multiple unavailability constraints: a mathematical model and an enhanced variable neighborhood search approach. J Comput Des Eng 4:46\u201359","journal-title":"J Comput Des Eng"},{"key":"384_CR34","doi-asserted-by":"crossref","unstructured":"Ye J, Ma H (2015) Multiobjective joint optimization of production scheduling and maintenance planning in the flexible job-shop problem. Math Probl Eng, Article ID 725460","DOI":"10.1155\/2015\/725460"},{"key":"384_CR35","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1007\/s00170-007-1268-5","volume":"39","author":"J Yulan","year":"2008","unstructured":"Yulan J, Zuhua J, Wenrui H (2008) Multi-objective integrated optimization research on preventive maintenance planning and production scheduling for a single machine. Int J Adv Manuf Technol 39:954\u2013964","journal-title":"Int J Adv Manuf Technol"},{"key":"384_CR36","first-page":"229","volume":"7","author":"Z Zahedi","year":"2016","unstructured":"Zahedi Z, Ari Samadhi TMA, Suprayogi S, Halim AH (2016) Integrated batch production and maintenance scheduling for multiple items processed on a deteriorating machine to minimize total production and maintenance costs with due date constraint. Int J Ind Eng Comput 7:229\u2013244","journal-title":"Int J Ind Eng Comput"},{"key":"384_CR37","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.apm.2009.07.002","volume":"34","author":"C-L Zhao","year":"2010","unstructured":"Zhao C-L, Tang H-Y (2010) Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. App Math Model 34:837\u2013841","journal-title":"App Math Model"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0384-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0384-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0384-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T08:26:23Z","timestamp":1595924783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0384-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,16]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["384"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0384-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,16]]},"assertion":[{"value":"22 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}