The CLWS heuristic for single machine scheduling problem

Kristina Šorić

doi:10.1016/S0377-2217(99)00162-9

The CLWS heuristic for single machine scheduling problem

2000-01-01

4

PRE

AI

K

Kristina Šorić *

DOI：10.1016/S0377-2217(99)00162-9

原文链接

原文求助

摘要

En 中文

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. The clear-the-largest-work-after-setup (CLWS) heuristic policy which stabilizes the system in the sense that, in the long run, the required demand is met, has been introduced. That way, a better upper bound on the total work backlog than those available in earlier literature is derived. Computational results for the case of finite horizon show that the error of the heuristic CLWS from the optimal solution is 2.5-3.0% on average. Some computational results that compare the CLWS heuristic to the heuristic available in the earlier literature, for the same problem, are also reported. (C) 2000 Elsevier Science B.V. All rights reserved.

Keyword:

scheduling theory

single machine scheduling

CLWS heuristic

The CLWS heuristic for single machine scheduling problem

摘要

AI总结

期刊

机构

引用论文