{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T21:34:34Z","timestamp":1720992874872},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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,7]]},"DOI":"10.1016\/s0377-2217(98)00196-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"183-193","source":"Crossref","is-referenced-by-count":7,"title":["Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints"],"prefix":"10.1016","volume":"116","author":[{"given":"B.M.T.","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C.E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00196-9_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/00207168808803664","article-title":"Relocation problems are hard","volume":"25","author":"Amir","year":"1988","journal-title":"International Journal of Computer Mathematics"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Scheduling with earliness and tardiness penalties: A review","volume":"38","author":"Baker","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: Classification and complexity","volume":"5","author":"Blazewicz","year":"1989","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","article-title":"Survey of scheduling research involving due date assignment","volume":"38","author":"Cheng","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB5","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freedman, San Francisco, CA, 1979"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB6","unstructured":"J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, UCLA, Los Angeles, 1955"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB7","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(98)00196-9_BIB8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1068\/b130005","article-title":"Relocation models for public housing redevelopment programs","volume":"13","author":"Kaplan","year":"1986","journal-title":"Planning Design"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0377-2217(88)90030-6","article-title":"A fast feasibility test for relocation problems","volume":"35","author":"Kaplan","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/inte.18.6.14","article-title":"Orient heights housing projects","volume":"18","author":"Kaplan","year":"1988","journal-title":"Interfaces"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB11","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, W.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB12","unstructured":"B.M.T. Lin, A Study on Relocation Problems, Ph.D. Dissertation, Department of Computer Science and Information Engineering, National Chiao-Tung University, Taiwan ROC, 1991"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB13","unstructured":"B.M.T. Lin, T.C.E. Cheng, On the strong NP-hardness of two-machine relocation problem of makespan minimization, in: The Sixth INFORMS Computer Science Technical Conference, California, USA, 1998, unpublished manuscript"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207169108803998","article-title":"Some results of relocation problems with processing times and deadlines","volume":"41","author":"Lin","year":"1991","journal-title":"International Journal of Computer Mathematics"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB15","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1080\/00207729208949397","article-title":"Maximizing new capacities under a common due date","volume":"23","author":"Lin","year":"1992","journal-title":"International Journal of Systems Science"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0377-2217(93)90098-8","article-title":"Generating the best k schedules in relocation problems","volume":"69","author":"Lin","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB17","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(98)00196-9_BIB18","unstructured":"PHRG, New Lives for Old Buildings: Revitalizing Public Housing Project, Public Housing Group, Department of Urban Studies and Planning, MIT, Cambridge, MA, 1986"},{"key":"10.1016\/S0377-2217(98)00196-9_BIB19","unstructured":"M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001969?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001969?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T13:20:20Z","timestamp":1556112020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798001969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0377221798001969"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00196-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}