A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops

Simple item page
dc.contributor.authorSinger, M
dc.contributor.authorPinedo, M
dc.date.accessioned2025-01-21T01:32:52Z
dc.date.available2025-01-21T01:32:52Z
dc.date.issued1998
dc.description.abstractWe present and compare a number of branch and bound algorithms for minimizing the total weighted tardiness in job shops. There are basically two types of branching schemes. The first one inserts operations in a partial schedule, while the second one fixes arcs in the disjunctive graph formulation of the problem. The bounding schemes are based on the analysis of precedence constraints, and on the solution of nonpreemptive single machine subproblems that are subject to so-called delayed precedence constraints. We obtain optimal solutions for all the instances with ten jobs and ten machines that we consider, including three tardiness versions of a well-known 10 x 10 instance introduced by Muth and Thompson [1] in 1963.
dc.fuente.origenWOS
dc.identifier.issn0740-817X
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/97333
dc.identifier.wosidWOS:000072207900001
dc.issue.numero2
dc.language.isoen
dc.pagina.final118
dc.pagina.inicio109
dc.revistaIie transactions
dc.rightsacceso restringido
dc.subject.ods12 Responsible Consumption and Production
dc.subject.odspa12 Producción y consumo responsable
dc.titleA computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops
dc.typeartículo
dc.volumen30
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files
Collections
Artículos de revistas