{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:14Z","timestamp":1759667294024},"reference-count":19,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":[[2001,9]]},"DOI":"10.1016\/s0305-0548(00)00031-9","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T16:10:39Z","timestamp":1039536639000},"page":"1111-1130","source":"Crossref","is-referenced-by-count":3,"title":["A heuristic approach for single-machine scheduling with due dates and class setups"],"prefix":"10.1016","volume":"28","author":[{"given":"Jason Chao-Hsien","family":"Pan","sequence":"first","affiliation":[]},{"given":"Jen-Shiang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Hung-Liang","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00031-9_BIB1","series-title":"Introduction to sequencing and scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V","article-title":"Scheduling tasks with sequence-dependent processing times","volume":"35","author":"Bianco","year":"1988","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB4","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0305-0483(90)90042-8","article-title":"A sequencing heuristic for dependent setups in a batch process industry","volume":"18","author":"Leong","year":"1990","journal-title":"OMEGA"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB5","series-title":"Theory of scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(90)90003-P","article-title":"Single facility multi-class job scheduling","volume":"17","author":"Ahn","year":"1990","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.20.1.24","article-title":"Single-server, two-machine sequencing with switching time","volume":"20","author":"Sahney","year":"1972","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB8","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1287\/opre.28.6.1347","article-title":"A dynamic programming approach for sequencing groups of identical jobs","volume":"28","author":"Psaraftis","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0","article-title":"Minimizing flow time on a single machine with job classes and setup times","volume":"38","author":"Mason","year":"1991","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0305-0548(91)90018-M","article-title":"Scheduling two job classes on a single machine","volume":"18","author":"Potts","year":"1991","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB11","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.16.2.342","article-title":"Minimum change-over scheduling of several products on one machine","volume":"16","author":"Glassey","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB12","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","article-title":"On the complexity of scheduling with batch setup times","volume":"37","author":"Monma","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","article-title":"Complexity of task sequencing with deadlines, set-up times and changeover costs","volume":"7","author":"Bruno","year":"1978","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0377-2217(91)90250-Y","article-title":"Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times","volume":"51","author":"Zdrzalka","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1057\/jors.1996.15","article-title":"A new heuristic for a single machine scheduling problem with set-up times","volume":"47","author":"Williams","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB16","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","article-title":"Scheduling groups of jobs on single machine","volume":"43","author":"Webster","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB17","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1080\/02533839.1997.9741862","article-title":"Single machine scheduling with due dates and class setups","volume":"20","author":"Pan","year":"1997","journal-title":"Journal of the Chinese Institute of Engineers"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB18","series-title":"Machine scheduling problem: classification, complexity and computations","author":"Rinnooy Kan","year":"1976"},{"key":"10.1016\/S0305-0548(00)00031-9_BIB19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one-machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Mathematical Programming"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T20:22:01Z","timestamp":1556223721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0305054800000319"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00031-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}