A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/80004
Tipus de documentText en actes de congrés
Data publicació2015
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
When 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
CitacióMateo, 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.
ISBN978-972-789-453-6
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
PAPERS_PDF_OR_M ... D_SIMULATION_166 Paper.pdf | 64,35Kb | Visualitza/Obre |