{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T21:13:57Z","timestamp":1771017237393,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":[[2004,9]]},"DOI":"10.1016\/s0305-0548(03)00117-5","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T18:48:19Z","timestamp":1054061299000},"page":"1727-1751","source":"Crossref","is-referenced-by-count":51,"title":["A branch-and-bound algorithm for the early\/tardy machine scheduling problem with a common due-date and sequence-dependent setup time"],"prefix":"10.1016","volume":"31","author":[{"given":"Ghaith","family":"Rabadi","sequence":"first","affiliation":[]},{"given":"Mansooreh","family":"Mollaghasemi","sequence":"additional","affiliation":[]},{"given":"Georgios C.","family":"Anagnostopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00117-5_BIB1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nav.3800280411","article-title":"Minimizing the average deviation of job completion times about a common due date","volume":"28","author":"Kanet","year":"1981","journal-title":"Naval Research Logistics"},{"issue":"1","key":"10.1016\/S0305-0548(03)00117-5_BIB2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties","volume":"38","author":"Baker","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/nav.3800330105","article-title":"Single- and multiple-processor models for minimizing completion time variance","volume":"33","author":"Hall","year":"1986","journal-title":"Naval Research Logistics Quarterly"},{"issue":"5","key":"10.1016\/S0305-0548(03)00117-5_BIB4","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness scheduling problems, I","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/S0305-0548(03)00117-5_BIB5","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1080\/002075497195344","article-title":"Scheduling job families about an unrestricted common due date on a single machine","volume":"35","author":"Azizoglu","year":"1997","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/nav.3800330206","article-title":"Minimizing mean absolute deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1986","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB7","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1002\/1520-6750(198910)36:5<663::AID-NAV3220360510>3.0.CO;2-X","article-title":"Single machine scheduling to minimize absolute deviation of completion times from a common due date","volume":"36","author":"Szwarc","year":"1989","journal-title":"Naval Research Logistics"},{"issue":"3","key":"10.1016\/S0305-0548(03)00117-5_BIB8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0305-0548(95)O0025-O","article-title":"The weighted common due date single machine scheduling problem revisited","volume":"23","author":"Szwarc","year":"1996","journal-title":"Computers and Operations Research"},{"issue":"5","key":"10.1016\/S0305-0548(03)00117-5_BIB9","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness-tardiness scheduling problems, II","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB10","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(95)00363-0","article-title":"A note on minimizing the weighted sum of tardy and early completion penalties in a single machine","volume":"96","author":"Alidaee","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"10.1016\/S0305-0548(03)00117-5_BIB11","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/S0305-0548(99)00153-7","article-title":"Single machine weighted earliness-tardiness penalty problem with a common due date","volume":"28","author":"Mondal","year":"2001","journal-title":"Computers and Operation Research"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB12","series-title":"Sequencing and scheduling: an introduction to the mathematics of the job-shop","author":"French","year":"1982"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1111\/j.1937-5956.1992.tb00354.x","article-title":"A simple model for optimizing the single machine early\/tardy problem with sequence-dependent setups","volume":"1","author":"Coleman","year":"1992","journal-title":"Production and Operation Management"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB14","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/S0377-2217(96)00096-3","article-title":"Scheduling with batch setup times and earliness-tardiness penalties","volume":"96","author":"Chen","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00117-5_BIB15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup consideration","volume":"27","author":"Allahverdi","year":"1999","journal-title":"OMEGA"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0377-2217(00)00197-1","article-title":"A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times","volume":"133","author":"Gendreau","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB17","unstructured":"Rabadi G. Minimizing the total earliness and tardiness for a single machine scheduling problem with a common due date and sequence dependent setup times. Dissertation, University of Central Florida, USA, 1999."},{"key":"10.1016\/S0305-0548(03)00117-5_BIB18","series-title":"Elements of sequencing and scheduling","author":"Baker","year":"1997"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB19","series-title":"AMPL: a modeling language for mathematical programming","author":"Fourer","year":"1993"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB20","unstructured":"ILOG CPLEX, ILOG CPLEX 6.5 user's manual. France: ILOG, 1999."},{"issue":"2","key":"10.1016\/S0305-0548(03)00117-5_BIB21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0305-0548(98)00051-3","article-title":"Early\/tardy scheduling with sequence dependent setup on uniform parallel machines","volume":"26","author":"Balakrishnan","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00117-5_BIB22","series-title":"Combinatorial optimization","author":"Papadimitriou","year":"1982"},{"issue":"7","key":"10.1016\/S0305-0548(03)00117-5_BIB23","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","article-title":"A branch-and-bound algorithm for the single-machine earliness and tardiness scheduling problem","volume":"26","author":"Liaw","year":"1999","journal-title":"Computers and Operations Research"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T04:52:17Z","timestamp":1553143937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0305054803001175"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00117-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}