Abstract
Many real manufacturing systems process a large number of product variants in the same flow. These products may differ in some optional components; consequently, the processing time on a machine differs from one product to the next, and the need to prepare one or more machines before beginning or after the finishing of jobs is frequently presented. The preparation activities are: machine adjustment and feeders preparation to process a next job, dismantling after a previous job, machine calibrating, inspection of accessories or tools, cleaning of the machines and adjacent areas, etc. In the scheduling theory, the time required to shift from one job to another on a given machine is defined as additional production cost or setup time. The scheduling problems, which consider the setup times, have a high computational complexity. Pinedo (2008) presents a proof of the NP-hardness of the single machine case with setup consideration. They are more complex when the resource model has the parallel machine environment.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call