A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems

Authors:
J. Miltenburg;G. Steiner;S. Yeomans
Affiliations:
Faculty of Business, McMaster University, Hamilton, Ontario L8S 4L8, Canada;Faculty of Business, McMaster University, Hamilton, Ontario L8S 4L8, Canada;Faculty of Business, McMaster University, Hamilton, Ontario L8S 4L8, Canada
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1990

Citing 2
Cited 5

Kanban, MRP and shaping the manufacturing environment

Management Science
Level schedules for mixed-model assembly lines in just-in-time production systems

Management Science

Dynamic programming solution to the batching problem in just-in-time flow-shops

Computers and Industrial Engineering
A multi-objective scatter search for a mixed-model assembly line sequencing problem

Advanced Engineering Informatics
A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem

Computers and Industrial Engineering
A comment on “A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems”

Operations Research Letters
A Pareto biogeography-based optimisation for multi-objective two-sided assembly line sequencing problems with a learning effect

Computers and Industrial Engineering

Quantified Score

Hi-index	0.98

Visualization

Abstract

A dynamic programming procedure for determining the optimal just-in-time (JIT) production schedule for a mixed-model facility is presented. Compared to previously available optimization methods it substantially reduces computation and storage requirements, enabling practical-sized problems to be solved. However, there are still difficulties for solving very large problems. Heuristics, which have been proposed for these large problems, can now be evaluated by generating problems and comparing the schedules produced by the heuristics with the optimal schedule. This is done for two heuristics.