Carregant...
Carregant...

Vés al contingut (premeu Retorn)

n-Cyclic Hoist Scheduling Problem to manufacture more than 2 products

Autor
Mateo, M.; Companys, R.
Tipus d'activitat
Document cientificotècnic
Data
2012-07-27
Repositori
http://hdl.handle.net/2117/16384 Obrir en finestra nova
Resum
Jobs of more than two products (n>2) must be manufactured in a production line of tanks. A hoist transports the jobs between tanks. If the size of both batches is equal and the number of jobs is high, a cyclic scheduling can be proposed. The problem consists in the scheduling of hoist movements, which is known as CHSP (Cyclic Hoist Scheduling Problem). The objective is double: first, determine a sequence of the n products in a job cycle and then minimise the cycle time for the given sequence of ...
Citació
Mateo, M.; Companys, R. "n-Cyclic Hoist Scheduling Problem to manufacture more than 2 products". 2012.
Grup de recerca
EOLI - Enginyeria d'Organització i Logística Industrial

Participants

Arxius