CHARACTERIZING THE MANUFACTURING SCHEDULING PROBLEM
CHARACTERIZING THE MANUFACTURING SCHEDULING PROBLEM
复制标题
DOI:
10.1016/0278-6125(91)90037-3
复制
发表时间:
1991-01-01
影响因子:
12.1
通讯作者:
PARUNAK, HV
中科院分区:
文献类型:
--
作者:
PARUNAK, HV
Scheduling a job shop is difficult even for human intelligence. The push toward increased automation and flexibility in manufacturing has led to a number of computerized schemes that address the problem with varying degrees of success. These schemes often have little in common with one another. It is not clear whether they are addressing the same problem or how they should be extended or combined to advance the state of the art in scheduling.The problem is of more than academic interest. The effective scheduling of a facility reduces its work-in-process inventory (WIP) and increases throughput-effectively increasing the return on investment. Scheduling is also important in enabling faster response to changing customer demands, thus gaining increased market share.This paper develops a general context for the scheduling problem, as a framework for understanding existing approaches and as a roadmap for future development. We propose a formal definition of a schedule and describe five challenges to the computation of schedules. We then classify existing scheduling strategies under the challenges they address. We suggest new strategies for those challenges that previous approaches do not handle well. The paper's main contribution is not to solve the scheduling problem, but to exhibit its complexity, show that existing techniques address only isolated parts of the problem, and plot a course for further work on a systems approach to scheduling.