Academic Journals Database
Disseminating quality controlled scientific knowledge

PREDICTING SEQUENCE DEPENDENT SET-UP TIMES FOR MULTISTATION MACHINES (A CASE STUDY)

ADD TO MY LIST
 
Author(s): A.E. Reinecke | D.C. Page

Journal: South African Journal of Industrial Engineering
ISSN 1012-277X

Volume: 9;
Issue: 1;
Date: 2012;
Original page

ABSTRACT
ENGLISH ABSTRACT: The set-up time for jobs on some multi-station machines , such as manually configured colour printers, are sequence dependent. Many techniques exist for fmding 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 ofthe 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 ajob 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.AFRIKAANSE OPSOMMING: Die opsteltyd vir take op sommige veelstasie masjiene, soos handgekonfigureerde kleurdrukkers, is . volgorde afhanklik. Vele tegnieke bestaan om die volgorde te bepaal waarin take geprosesseer moet word om opsteltyd beduidend te verminder. Al die tegnieke vereis die opsteltyd van die volgende taak, gegewe die opsteltyd van die voorgaande taak. In die praktyk mag raming van opsteltye vir skeduleringsdoeleindes onhanteerbaar lank neem. In hierdie artikel word 'n praktiese tegniek beskryf wat die opsteltyd beraarn vir vir 'n taak op 'nveelstasie masjien, soos 'n handgekonfigureerde drukpers. 'n Toepassing in 'n riffelkartondoos fabriek , waar die tegniek toegepas word as deel van 'n gerekenariseerde skeduleringsisteem, word bespreek.

Tango Rapperswil
Tango Rapperswil

    
RPA Switzerland

RPA Switzerland

Robotic process automation