engleski

The CLWS Heuristic for SIngle Machine Sequencing Problem

A model for real-time control of flexible manufacturing systems is considered. In this model, a machine can process a finite number of part types at specified rates, but only one part type can be processed at any given time. Each switch from one type to another requires setup time. A better upper bound on the total work backlog than those available in literature is derived by introducing the clear-the-largestwork-after-setup (CLWS) heuristic policy which stabilizes the system in the sense that, in the long run, the required demand is met. Computational results for the case of finite horizont show that CLWS heuristic is very effective and reduces the CPU time significantly.

Single machine sequencing; CLWS heuristic

nije evidentirano