{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T10:43:08Z","timestamp":1744627388042},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0377-2217(98)00323-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"95-100","source":"Crossref","is-referenced-by-count":10,"title":["On the complexity of two-machine flowshop problems with due date related objectives"],"prefix":"10.1016","volume":"106","author":[{"given":"Christos","family":"Koulamas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00323-3_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three-stage production schedule with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB2","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":"10.1016\/S0377-2217(98)00323-3_BIB3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB4","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0377-2217(89)90107-0","article-title":"A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop","volume":"38","author":"Hariri","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB5","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1287\/mnsc.23.9.1016","article-title":"Sequencing n jobs on m machines to minimize maximum tardiness: A branch-and-bound solution","volume":"23","author":"Townsend","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0305-0548(89)90005-1","article-title":"The two-machine flowshop scheduling problem with total tardiness","volume":"16","author":"Sen","year":"1989","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0305-0548(93)90083-U","article-title":"A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops","volume":"20","author":"Kim","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB8","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB9","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1287\/moor.7.4.532","article-title":"Complexity and solutions of some three-stage flow shop scheduling problems","volume":"7","author":"Achugbue","year":"1982","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB10","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.21.5.544","article-title":"Flowshop sequencing problem with ordered processing time matrices","volume":"21","author":"Smith","year":"1975","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0305-0548(94)E0007-T","article-title":"Flowshop scheduling with dominant machines","volume":"22","author":"Ho","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB12","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n job one machine sequencing algorithm for minimizing the number of late jobs","volume":"14","author":"Moore","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB13","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"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB14","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"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB15","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/00207547608956381","article-title":"An ordered flow-shop sequencing problem with mean completion time criterion","volume":"14","author":"Panwalkar","year":"1976","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB16","series-title":"Research Report 43","article-title":"Scheduling a production line to minimize maximum tardiness","author":"Jackson","year":"1955"},{"key":"10.1016\/S0377-2217(98)00323-3_BIB17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three stage production schedules with set-up times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:58:15Z","timestamp":1556657895000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221798003233"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00323-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}