{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:28:53Z","timestamp":1770499733352,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/0305-0548(96)00012-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"909-916","source":"Crossref","is-referenced-by-count":37,"title":["Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness"],"prefix":"10.1016","volume":"23","author":[{"given":"Ali","family":"Allahverdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(96)00012-3_BIB1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","author":"Lenstra","year":"1977","journal-title":"Ann. of Discrete Math."},{"key":"10.1016\/0305-0548(96)00012-3_BIB2","first-page":"133","article-title":"On two-machine scheduling with release dates and due dates to minimize maximum lateness","volume":"17","author":"Grabowski","year":"1980","journal-title":"Opsearch"},{"key":"10.1016\/0305-0548(96)00012-3_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/moor.6.1.153","article-title":"Minimizing maximum lateness in a two-machine open shop","volume":"6","author":"Lawler","year":"1981","journal-title":"Mathematics of Opns Res."},{"key":"10.1016\/0305-0548(96)00012-3_BIB4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0305-0548(91)90060-5","article-title":"Job lateness in a two-machine flowshop with setup times separated","volume":"18","author":"Dileepan","year":"1991","journal-title":"Computers Opns Res."},{"key":"10.1016\/0305-0548(96)00012-3_BIB5","first-page":"47","article-title":"Optimal policies for a deterministic two-machine semi-ordered flowshop with maximum lateness objective","volume":"6","author":"Allahverdi","year":"1994","journal-title":"Trans. Opl Res."},{"key":"10.1016\/0305-0548(96)00012-3_BIB6","series-title":"Symposium on the Theory of Scheduling and its Applications","first-page":"29","article-title":"Sequencing research and the industrial scheduling problem","author":"Panwalkar","year":"1973"},{"key":"10.1016\/0305-0548(96)00012-3_BIB7","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1287\/mnsc.31.7.852","article-title":"Focused scheduling in proportionate flowshops","volume":"31","author":"Ow","year":"1985","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(96)00012-3_BIB8","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/0377-2217(93)E0318-R","article-title":"Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function","volume":"81","author":"Allahverdi","year":"1995","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(96)00012-3_BIB9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0895-7177(94)90202-X","article-title":"Two-machine ordered flowshop scheduling under random breakdowns","volume":"20","author":"Allahverdi","year":"1994","journal-title":"Math. and Computer Modelling"},{"key":"10.1016\/0305-0548(96)00012-3_BIB10","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1057\/jors.1995.122","article-title":"Two-stage production scheduling with separated set-up times and stochastic breakdowns","volume":"46","author":"Allahverdi","year":"1995","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(96)00012-3_BIB11","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1002\/1520-6750(199512)42:8<1251::AID-NAV3220420809>3.0.CO;2-Q","article-title":"A note on minimizing the expected makespan in flowshops subject to breakdowns","volume":"42","author":"Du","year":"1995","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0305-0548(96)00012-3_BIB12","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1287\/opre.41.4.786","article-title":"Stochastic single machine scheduling with quadratic early-tardy penalties","volume":"41","author":"Mittenthal","year":"1993","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(96)00012-3_BIB13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/opre.30.1.148","article-title":"Minimizing the expected makespan in stochastic flowshops","volume":"30","author":"Pinedo","year":"1982","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(96)00012-3_BIB14","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/1520-6750(199010)37:5<661::AID-NAV3220370506>3.0.CO;2-3","article-title":"Single-machine scheduling subject to stochastic breakdowns","volume":"37","author":"Birg","year":"1990","journal-title":"Naval Research Logist."},{"key":"10.1016\/0305-0548(96)00012-3_BIB15","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1002\/nav.3800310405","article-title":"Stochastically minimizing the makespan in flowshops","volume":"31","author":"Foley","year":"1984","journal-title":"Naval Research Logist. Q."},{"key":"10.1016\/0305-0548(96)00012-3_BIB16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/nav.3800330111","article-title":"Scheduling n nonoverlapping jobs and two stochastic jobs in a flowshop","volume":"33","author":"Foley","year":"1984","journal-title":"Naval Research Logist. Q."},{"key":"10.1016\/0305-0548(96)00012-3_BIB17","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.34.1.130","article-title":"On Johnson's two-machine flowshop with random processing times","volume":"34","author":"Ku","year":"1986","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(96)00012-3_BIB18","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054896000123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054896000123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T02:28:28Z","timestamp":1555986508000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054896000123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":18,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0305054896000123"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(96)00012-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}