Show simple item record

dc.creatorFrancisco Román Angel Bello Acosta
dc.date2011
dc.date.accessioned2018-10-18T22:08:19Z
dc.date.available2018-10-18T22:08:19Z
dc.identifier.issn0307904X
dc.identifier.doi10.1016/j.apm.2010.11.017
dc.identifier.urihttp://hdl.handle.net/11285/630552
dc.descriptionWe study a single machine scheduling problem with availability constraints and sequence-dependent setup costs, with the aim of minimizing the makespan. To the authors' knowledge, this problem has not been treated as such in the operations research literature. We derive in this paper a mixed integer programming model to deal with such scheduling problem. Computational tests showed that commercial solvers are capable of solving only small instances of the problem. Therefore, we propose two ways for reducing the execution time, namely a valid inequality that strengthen the linear relaxation and an efficient heuristic procedure that provides a starting feasible solution to the solver. A substantial gain is achieved both in terms of the linear programming relaxation bound and in terms of the time to obtain an integer optimum when we use the enhanced model in conjunction with providing to the solver the solution obtained by the proposed heuristic. © 2010 Elsevier Inc.
dc.languageeng
dc.relationhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78650292739&doi=10.1016%2fj.apm.2010.11.017&partnerID=40&md5=de6063e776f1449091a712fa7c023e11
dc.relationInvestigadores
dc.relationEstudiantes
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.sourceApplied Mathematical Modelling
dc.subjectAvailability constraints
dc.subjectMixed integer models
dc.subjectScheduling problem
dc.subjectSetup costs
dc.subjectValid inequality
dc.subjectCosts
dc.subjectHeuristic methods
dc.subjectMachinery
dc.subjectOptimization
dc.subjectScheduling
dc.subjectScheduling algorithms
dc.subjectInteger programming
dc.subject.classification7 INGENIERÍA Y TECNOLOGÍA
dc.titleA single machine scheduling problem with availability constraints and sequence-dependent setup costs
dc.typeArtículo
dc.identifier.volume35
dc.identifier.issue4
dc.identifier.startpage2041
dc.identifier.endpage2050
refterms.dateFOA2018-10-18T22:08:19Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess