DECOMPOSITION FOR SCHEDULING FLEXIBLE MANUFACTURING SYSTEMS
成果类型：
Article
署名作者：
INMAN, RR; JONES, PC
署名单位：
Northwestern University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.41.3.608
发表日期：
1993
页码：
608-617
关键词：
摘要：
In some flexible manufacturing systems, tool magazine capacity naturally divides parts into families so that substantial setups occur only when switching production between families. For this situation (positive setup times and costs only between families), we show that the production planning problem decomposes into two simpler problems: an aggregate scheduling problem, and a disaggregation. First, we derive a disaggreption that determines the optimal intrafamily product schedules corresponding to a given family schedule in polynomial time. Second, we show how to aggregate so that the decomposition maintains optimality for family schedules satisfying the property that production does not begin until inventory is zero (the Zero-Switch rule).