Quick and dirty sequencing for mixed-model multi-level JIT systems
暂无分享,去创建一个
Abstract 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 between 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.
[1] R. R. Inman,et al. Sequencing JIT mixed-model assembly lines , 1991 .
[2] John Miltenburg,et al. Scheduling mixed-model multi-level just-in-time production systems , 1989 .
[3] John B. Kidd,et al. Toyota Production System , 1993 .
[4] J. Miltenberg,et al. Level schedules for mixed-model assembly lines in just-in-time production systems , 1989 .
[5] S. Sethi,et al. A Note on "Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems" , 1991 .