Show simple item record

dc.contributor.authorMateo Doll, Manuel
dc.contributor.authorCompanys Pascual, Ramón
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.date.accessioned2007-02-05T12:47:32Z
dc.date.available2007-02-05T12:47:32Z
dc.date.issued2007-01
dc.identifier.urihttp://hdl.handle.net/2117/633
dc.description.abstractJobs of two products must receive the same treatments in a production line of tanks. If the size of both batches is equal, we propose a cyclic manufacturing composed of a job from batch 1 and a job from batch 2. A hoist ensures the transfer of the jobs between tanks. The problem consists in the scheduling of hoist movements, which is known as HSP (Hoist Scheduling Problem). There is a comparison between completely separated and mixed production for both batches. The objective is to determine a sequence which minimises the cycle time for two jobs from different products (2-product cycle). We propose a branch-and-bound procedure, which can also be applied to the 2-cycle case for a single product. The model can be extended to ncycles.
dc.format.extent46p.
dc.language.isoeng
dc.relation.ispartofseriesDITS
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/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.titleNew computational experiences on the Hoist Scheduling Problem for cyclic manufacturing of different products.
dc.typeExternal research report
dc.subject.lemacAlgorismes -- Informes tècnics
dc.subject.lemacOptimització combinatòria
dc.rights.accessOpen Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 2.5 Spain