Predicting sequence dependent set-up times for multi-station machines (a case study)

Reinecke, A. E. ; Page, D. C. (1998)

CITATION: Reinecke, A. E. & Page, D. C. 1998. Predicting sequence dependent set-up times for multi-station machines (a case study). South African Journal of Industrial Engineering, 9(1): 67-79, doi: http://dx.doi.org/10.7166/9-1-381.

The original publication is available at http://sajie.journals.ac.za

Article

The set-up time for jobs on some multi-station machines, such as manually configured colour printers, are sequence dependent. Many techniques exist for finding a sequence in which to process the jobs to reduce total set-up time significantly. They all require an estimate ofthe set-up time for each job given the set-up of the previous job. In practice predicting set-up times for scheduling purposes may become prohibitively time consuming. In this article a practical technique is presented that estimates the set-up time for a job on a multi-station machine, such as a manually configured printer. An application in a corrugated cardboard box factory, where the technique is in use as part of a computerised scheduling system, is discussed.

Please refer to this item in SUNScholar by using the following persistent URL: http://hdl.handle.net/10019.1/70786
This item appears in the following collections: