Browsing by Subject "n-cycle"
Now showing items 1-2 of 2
A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product (2015)
Open AccessWhen 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 ...
New computational experiences on the Hoist Scheduling Problem for cyclic manufacturing of different products. (2007-01)
External research report
Open AccessJobs 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 ...