QUICK AND DIRTY SEQUENCING FOR MIXED-MODEL MULTILEVEL JIT SYSTEMS

被引:24
作者
INMAN, RR [1 ]
BULFIN, RL [1 ]
机构
[1] AUBURN UNIV,DEPT IND ENGN,AUBURN,AL 36849
关键词
Completion Times - Due Dates - Quick and Dirty Algorithm;
D O I
10.1080/00207549208948135
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We extend an intuitive level part usage measure to the multi-level case, and provide a practical yet powerful algorithm. The measure assigns an ideal due-date to each unit of each part type of each level, and sums the squared deviation betweeen these ideal due-dates and the actual completion times. The algorithm schedules the final products in earliest ideal due-date order. This algorithm entirely ignores the lower levels and is consequently extremely fast. Surprisingly, in addition to being many times faster than other algorithms, this quick and dirty algorithm performs very well with respect to both the new ideal due-date measure, and the multi-level goal-chasing measure.
引用
收藏
页码:2011 / 2018
页数:8
相关论文
共 5 条
[1]  
Inman R.R., Bulfin R.L., Management Science, 37, (1991)
[2]  
Kubiak W., Sethi S., A note on level schedules for mixed-model assembly lines in justin-time production systems, Management Science, 37, (1991)
[3]  
Miltenburg J., A theoretical basis for scheduling mixed-model assembly lines for just-intime production systems, Management Science, 35, (1989)
[4]  
Miltenburg J., Sinnamon G., Scheduling mixed-model multi-level just-in-time production systems, International Journal of Production Research, 27, 9, (1989)
[5]  
Monden Y., Toyota Production System, (1983)