Parallel machine scheduling with precedence constraints and setup times

Simple item page
dc.creatorGacias, Bernat
dc.creatorArtigues, Christian
dc.creatorLopez, Pierre
dc.date2009-02-18
dc.date.accessioned2026-07-07T12:43:32Z
dc.date.available2026-07-07T12:43:32Z
dc.descriptionThis paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search methods mixed with local search principles, dominance conditions and specific lower bounds are proposed. The proposed methods are evaluated on a set of randomly generated instances and compared with previous results from the literature and those obtained with an efficient commercial solver. We conclude that our propositions are quite competitive and our results even outperform other approaches in most cases.
dc.identifierhttps://arxiv.org/abs/0902.3121
dc.identifierhttp://arxiv.org/abs/0902.3121
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/220454
dc.subjectData Structures and Algorithms
dc.titleParallel machine scheduling with precedence constraints and setup times
dc.typetext

Files

Collections

arXiv