Show simple item record

dc.contributor.authorMateo Doll, Manuel
dc.contributor.authorManier, Marie-Ange
dc.contributor.authorCompanys Pascual, Ramón
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.date.accessioned2015-11-27T12:01:39Z
dc.date.available2015-11-27T12:01:39Z
dc.date.issued2015
dc.identifier.citationMateo, M., Manier, M., Companys , R. A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product. A: International Conference on Industrial Engineering and Industrial Management. International Conference on Industrial Engineering and Operations Management. International IIE Conference. "Engineering Systems and Networks: the way ahead for industrial engineering and operations management". Aveiro: 2015, p. 1-8.
dc.identifier.isbn978-972-789-453-6
dc.identifier.urihttp://hdl.handle.net/2117/80004
dc.description.abstractWhen various kinds of products must receive the sam e treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can be scheduled. A hoist ensures the auto-mated transfer of the jobs between tanks. The problem consists in the scheduling of repetitive hoist movements, which is known as CHSP (Cyclic Hoist Scheduling Problem). The objective is to find a sequence which minimizes the cycle time for jobs from different products. We consider the probl em wheren types of products must be treated and we search an n-cyclic schedule. The algorithm is based on the resolution of different sequences of products. For each one, a branch-and-bound is solved which considers only coherent subsequences. It enables to reduce the com-putational times most of the time for instances with 5 tanks and 4 product types
dc.format.extent8 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject.otherScheduling
dc.subject.otherbranch-and-bound
dc.subject.othern-cycle
dc.subject.otherHoist Scheduling Problem.
dc.titleA procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product
dc.typeConference report
dc.subject.lemacEmpreses -- Direcció i administració
dc.subject.lemacAlgorismes
dc.subject.lemacProducció -- Organització
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.rights.accessOpen Access
local.identifier.drac16675214
dc.description.versionPostprint (published version)
local.citation.authorMateo, M.; Manier, M.; Companys, R.
local.citation.contributorInternational Conference on Industrial Engineering and Industrial Management. International Conference on Industrial Engineering and Operations Management. International IIE Conference
local.citation.pubplaceAveiro
local.citation.publicationNameEngineering Systems and Networks: the way ahead for industrial engineering and operations management
local.citation.startingPage1
local.citation.endingPage8


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record