Mostrar el registro sencillo del ítem
A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
dc.contributor.author | Vélez Gallego, Mario C. | |
dc.contributor.author | Maya, Jairo | |
dc.contributor.author | Montoya Torres, Jairo Rafael | |
dc.date.accessioned | 08/29/2019 10:09 | |
dc.date.available | 08/29/2019 10:09 | |
dc.date.issued | 2016 | |
dc.identifier.citation | Carlos A. Trujillo, Angela Trujillo & Diana Obando (2019) Does it matter if drugs are legal? Legalising decreases the influence of beliefs in a moral order in consumption among adolescents, Addiction Research & Theory, 27:6, 472-481, DOI: 10.1080/16066359.2018.1544626 | es_CO |
dc.identifier.other | https://www.sciencedirect.com/science/article/pii/S0305054816300776#! | |
dc.identifier.uri | http://hdl.handle.net/10818/36944 | |
dc.description | 11 páginas | es_CO |
dc.description.abstract | This paper considers the problem of scheduling a set of jobs subject to arbitrary release dates and sequence-dependent setup times on a single machine with the objective of minimizing the maximum completion of all the jobs, or makespan. This problem is often found in manufacturing processes such as painting and metalworking. A new mixed integer linear program (MILP) is firstly proposed. Because the problem is known to be NP-hard, a beam search heuristic is developed. Computational experiments are carried out using a well-known set of instances from the literature. Our results show that the proposed heuristic is effective in finding high quality solutions at low computational cost. | en |
dc.format | application/pdf | es_CO |
dc.language.iso | eng | es_CO |
dc.publisher | Computers & Operations Research | es_CO |
dc.relation.ispartofseries | Computers & Operations Research Volume 73, September 2016, Pages 132-140 | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.source | Universidad de La Sabana | es_CO |
dc.source | Intellectum Repositorio Universidad de La Sabana | es_CO |
dc.subject.other | Single machine scheduling | en |
dc.subject.other | Release datesSequence-dependent setup times | en |
dc.subject.other | Beam search | en |
dc.subject.other | Makespan | en |
dc.title | A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan | en |
dc.type | journal article | es_CO |
dc.type.hasVersion | publishedVersion | es_CO |
dc.rights.accessRights | openAccess | es_CO |
dc.identifier.doi | 10.1016/j.cor.2016.04.009 |
Ficheros en el ítem
Ficheros | Tamaño | Formato | Ver |
---|---|---|---|
No hay ficheros asociados a este ítem. |