Heuristic methods for the single machine scheduling problem with different ready times and a common due date

dc.creatorBirgin, Ernesto G.
dc.creatorRonconi, Debora Pretti
dc.date.accessioned2013-11-01T09:54:13Z
dc.date.accessioned2018-07-04T16:07:11Z
dc.date.available2013-11-01T09:54:13Z
dc.date.available2018-07-04T16:07:11Z
dc.date.created2013-11-01T09:54:13Z
dc.date.issued2012
dc.identifierENGINEERING OPTIMIZATION, ABINGDON, v. 44, n. 10, supl. 4, Part 1-2, pp. 1197-1208, DEC, 2012
dc.identifier0305-215X
dc.identifierhttp://www.producao.usp.br/handle/BDPI/37147
dc.identifier10.1080/0305215X.2011.634409
dc.identifierhttp://dx.doi.org/10.1080/0305215X.2011.634409
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1631672
dc.description.abstractThe single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs.
dc.languageeng
dc.publisherTAYLOR & FRANCIS LTD
dc.publisherABINGDON
dc.relationENGINEERING OPTIMIZATION
dc.rightsCopyright TAYLOR & FRANCIS LTD
dc.rightsrestrictedAccess
dc.subjectSCHEDULING
dc.subjectSINGLE MACHINE
dc.subjectEARLINESS
dc.subjectTARDINESS
dc.subjectHEURISTIC METHODS
dc.titleHeuristic methods for the single machine scheduling problem with different ready times and a common due date
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución