{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:59:39Z","timestamp":1774418379514,"version":"3.50.1"},"reference-count":16,"publisher":"FapUNIFESP (SciELO)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pesqui. Oper."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p>Neste artigo consideramos um problema de sequenciamento com um \u00fanico processador no qual existem datas de disponibilidade inteiras e uma data de entrega comum. O objectivo consiste em minimizar a soma ponderada dos custos de posse e de atraso. Um algoritmo polinomial \u00e9 apresentado para o caso no qual os tempos de processamento s\u00e3o iguais a um. \u00c9 tamb\u00e9m desenvolvido um algoritmo que permite determinar, para o caso geral, o menor valor n\u00e3o restritivo da data de entrega.<\/jats:p>","DOI":"10.1590\/s0101-74382003000300004","type":"journal-article","created":{"date-parts":[[2005,4,26]],"date-time":"2005-04-26T09:26:47Z","timestamp":1114507607000},"page":"443-456","source":"Crossref","is-referenced-by-count":2,"title":["[NO TITLE AVAILABLE]"],"prefix":"10.1590","volume":"23","author":[{"given":"Jorge M. S.","family":"Valente","sequence":"first","affiliation":[{"name":"Universidade do Porto,  Portugal"}]},{"given":"Rui A. F. S.","family":"Alves","sequence":"additional","affiliation":[{"name":"Universidade do Porto,  Portugal"}]}],"member":"530","reference":[{"key":"ref1","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO;2-3","article-title":"Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and common due date","volume":"34","author":"Bagchi U.","year":"1987","journal-title":"Naval Research Logistics Quarterly","ISSN":"https:\/\/id.crossref.org\/issn\/0028-1441","issn-type":"print"},{"key":"ref2","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 U.","year":"1986","journal-title":"Naval Research Logistics Quarterly","ISSN":"https:\/\/id.crossref.org\/issn\/0028-1441","issn-type":"print"},{"key":"ref3","series-title":"Algorithms for minimizing earliness and tardiness penalties with a common due date","author":"Baker K.","year":"1989"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: A review","author":"Baker K.","year":"1990","journal-title":"Operations Research","ISSN":"https:\/\/id.crossref.org\/issn\/0030-364X","issn-type":"print"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0895-7177(00)00250-8","article-title":"Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties","volume":"33","author":"Bank J.","year":"2001","journal-title":"Mathematical and Computer Modelling"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1957","DOI":"10.1016\/S0305-0548(01)00067-3","article-title":"Common due date assignment and scheduling with ready times","volume":"29","author":"Cheng T.C.E.","year":"2002","journal-title":"Computers & Operations Research"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date","volume":"39","author":"Hall N.","year":"1991","journal-title":"Operations Research","ISSN":"https:\/\/id.crossref.org\/issn\/0030-364X","issn-type":"print"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/opre.42.1.102","article-title":"New lower and upper bounds for scheduling around a small common due date","volume":"42","author":"Hoogeveen J.","year":"1994","journal-title":"Operations Research","ISSN":"https:\/\/id.crossref.org\/issn\/0030-364X","issn-type":"print"},{"key":"ref9","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 J.","year":"1981","journal-title":"Naval Research Logistics Quarterly","ISSN":"https:\/\/id.crossref.org\/issn\/0028-1441","issn-type":"print"},{"key":"ref10","series-title":"Logistics of Production and Inventory, Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Sequencing and scheduling: Algorithms and complexity","author":"Lawler E.L.","year":"1993"},{"key":"ref11","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 S.A.","year":"2001","journal-title":"Computers & Operations Research"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1080\/00207549308956801","article-title":"Dynamic single-machine weighted absolute deviation problem: Predictive heuristics and evaluation","volume":"31","author":"Nandkeolyar U.","year":"1993","journal-title":"International Journal of Production Research"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0377-2217(96)00133-6","article-title":"A decision theory based scheduling procedure for single machine weighted earliness and tardiness problem","volume":"94","author":"Sridharan V.","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute lateness in single machine and multimachine scheduling","volume":"31","author":"Sundararaghavan P.","year":"1984","journal-title":"Naval Research Logistics Quarterly","ISSN":"https:\/\/id.crossref.org\/issn\/0028-1441","issn-type":"print"},{"key":"ref15","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 W.","year":"1989","journal-title":"Naval Research Logistics"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(95)00006-6","article-title":"An improved dynamic programming algorithm for the single machine mean absolute deviation problem with a restrictive common due date","volume":"17","author":"Ventura J.A.","year":"1995","journal-title":"Operations Research Letters"}],"container-title":["Pesquisa Operacional"],"original-title":[],"link":[{"URL":"http:\/\/www.scielo.br\/pdf\/pope\/v23n3\/a04v23n3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T20:32:43Z","timestamp":1495657963000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.scielo.br\/scielo.php?script=sci_arttext&pid=S0101-74382003000300004&lng=pt&tlng=pt"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0101-74382003000300004"],"URL":"https:\/\/doi.org\/10.1590\/s0101-74382003000300004","relation":{},"ISSN":["0101-7438"],"issn-type":[{"value":"0101-7438","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}