{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T19:57:31Z","timestamp":1771876651003,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00396-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"81-97","source":"Crossref","is-referenced-by-count":103,"title":["Match-up scheduling under a machine breakdown"],"prefix":"10.1016","volume":"112","author":[{"given":"M.Selim","family":"Akturk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elif","family":"Gorgulu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/S0377-2217(97)00396-2_BIB1","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1007\/BF00288977","article-title":"Single machine flow-time scheduling with a single breakdown","volume":"26","author":"Adiri","year":"1989","journal-title":"Acta Informatica"},{"issue":"8","key":"10.1016\/S0377-2217(97)00396-2_BIB2","doi-asserted-by":"crossref","first-page":"2299","DOI":"10.1080\/00207549608905026","article-title":"Part-machine grouping using a multi-objective cluster analysis","volume":"34","author":"Akturk","year":"1996","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00396-2_BIB3","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/opre.39.3.470","article-title":"Match-up scheduling with multiple resources, release dates and disruption","volume":"39","author":"Bean","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB4","doi-asserted-by":"crossref","unstructured":"J. Blazewicz, K. Ecker, G. Schmidt, J. Weglarz, Scheduling in Computer and Manufacturing Systems, Springer, Berlin, 1993","DOI":"10.1007\/978-3-662-00074-8"},{"issue":"2","key":"10.1016\/S0377-2217(97)00396-2_BIB5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","article-title":"A branch-and-bound algorithm to minimize total tardiness with different release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"10.1016\/S0377-2217(97)00396-2_BIB6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/09511928808944350","article-title":"A real-time production scheduler for a stochastic manufacturing environment","volume":"1","author":"Davis","year":"1988","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB7","unstructured":"J. Du, J.Y. Leung, Minimizing mean flow time with release time and deadline constraints, Technical Report, Computer Science Program, University of Texas, Dallas, 1988"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(97)00396-2_BIB9","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1287\/opre.29.4.646","article-title":"A review of production scheduling","volume":"29","author":"Graves","year":"1981","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(97)00396-2_BIB10","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","article-title":"The total tardiness problem: review and extensions","volume":"42","author":"Koulamas","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB11","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in OR&MS, vol. 4, Elsevier, Amsterdam, 1993","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB12","doi-asserted-by":"crossref","unstructured":"C.-Y. Lee, Machine scheduling with an availability constraint, Journal of Global Optimization, 9 (1996) 395\u2013416","DOI":"10.1007\/BF00121681"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB13","doi-asserted-by":"crossref","unstructured":"C.-Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, in: Operations Research Letters, 20 (1997) 129\u2013139","DOI":"10.1016\/S0167-6377(96)00041-7"},{"issue":"4","key":"10.1016\/S0377-2217(97)00396-2_BIB14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01178778","article-title":"Single machine flow-time scheduling with scheduled maintenance","volume":"29","author":"Lee","year":"1992","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB15","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(90)90055-H","article-title":"Capacitated two-parallel machine scheduling to minimize sum of job completion times","volume":"41","author":"Lee","year":"1993","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"10.1016\/S0377-2217(97)00396-2_BIB16","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 Transactions"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB17","unstructured":"T.E. Morton, R.V. Rachamadugu, A.P.J. Vepsalainen, Accurate myopic heuristics for tardiness scheduling, Working Paper 36-83-84, GSIA, Carnegie Mellon University, 1984"},{"key":"10.1016\/S0377-2217(97)00396-2_BIB18","unstructured":"T.E. Morton, D.W. Pentico, Heuristic Scheduling Systems: With Applications to Production Systems and Project Management, Wiley, New York, 1993"},{"issue":"4","key":"10.1016\/S0377-2217(97)00396-2_BIB19","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1080\/09537289108919359","article-title":"Adaptive\/predictive scheduling; review and a general framework","volume":"2","author":"Nof","year":"1991","journal-title":"Production Planning and Control"},{"issue":"6","key":"10.1016\/S0377-2217(97)00396-2_BIB20","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1057\/jors.1990.78","article-title":"An integrated framework for generating and revising factory schedules","volume":"41","author":"Smith","year":"1990","journal-title":"Journal of Operational Research Society"},{"issue":"2","key":"10.1016\/S0377-2217(97)00396-2_BIB21","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1080\/09537289408919480","article-title":"Knowledge-based reactive scheduling","volume":"5","author":"Szelke","year":"1994","journal-title":"Production Planning and Control"},{"issue":"1","key":"10.1016\/S0377-2217(97)00396-2_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0548(93)90091-V","article-title":"One-machine rescheduling heuristics with efficiency and stability as criteria","volume":"20","author":"Wu","year":"1993","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003962?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003962?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T04:43:00Z","timestamp":1578890580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221797003962"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00396-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}