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.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.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
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


This item appears in the following Collection(s)

Show simple item record

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