{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:23Z","timestamp":1760706503951},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000,1]]},"DOI":"10.1016\/s0377-2217(99)00164-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"375-381","source":"Crossref","is-referenced-by-count":40,"title":["Minimizing tardy jobs in a flowshop with common due date"],"prefix":"10.1016","volume":"120","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[]},{"given":"Jatinder N.D","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tadei","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00164-2_BIB1","unstructured":"F. Della Croce, J.N.D. Gupta, D. Maio, R. Tadei, Minimizing the number of tardy jobs on a two-machine flow-shop with common due date, Internal Report, D.A.I. Politecnico di Torino, Italy, 1997"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1080\/00207547108929878","article-title":"M-stage scheduling problem: A critical appraisal","volume":"9","author":"Gupta","year":"1971","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB3","unstructured":"J.N.D. Gupta, Scheduling research paradigms: Review and Extensions, in: Production as a Mean of Improving Productivity, Proceedings of the Seventh International Conference at Windsor, Canada, 1984, pp. 377\u2013383"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB4","unstructured":"J.N.D. Gupta, A.M.A. Hariri, Integrating job selection and scheduling in a flowshop, Working paper, Department of Management, Ball State University, Muncie, IN, 1994"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB5","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1057\/palgrave.jors.2600346","article-title":"Two machine flow-shop to minimize number of tardy jobs","volume":"48","author":"Gupta","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0377-2217(89)90107-0","article-title":"A branch and bound algorithm to minimize number of late jobs in a permutation flow-shop","volume":"38","author":"Hariri","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB7","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(99)00164-2_BIB8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB9","first-page":"27","article-title":"Scheduling shops to minimize the weighted number of late jobs","volume":"10","author":"Jozefowska","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB10","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 et al. (Eds.), Handbook of Operations Research, vol. 4, Elsevier, Amsterdam, 1993, pp. 445\u2013552","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00164-2_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":"15","author":"Moore","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00164-2_BIB13","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.21.5.544","article-title":"Flowshop sequencing with ordered processing times matrices","volume":"21","author":"Smith","year":"1975","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001642?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001642?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T18:00:48Z","timestamp":1579024848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0377221799001642"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00164-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}