Loading...
Loading...

Go to the content (press return)

A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product

Author
Mateo, M.; Manier, M.; Companys, R.
Type of activity
Presentation of work at congresses
Name of edition
International Conference on Industrial Engineering and Industrial Management. International Conference on Industrial Engineering and Operations Management. International IIE Conference
Date of publication
2015
Presentation's date
2015-07-07
Book of congress proceedings
Engineering Systems and Networks: the way ahead for industrial engineering and operations management
First page
1
Last page
8
Repository
http://hdl.handle.net/2117/80004 Open in new window
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 ...
Citation
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.
Keywords
Hoist Scheduling Problem., Scheduling, branch-and-bound, n-cycle
Group of research
SCOM - Supply Chain and Operations Management

Participants