A bicriterion objective for levelling the schedule of a mixed-model, JIT assembly process

Authors:
G. Steiner;S. Yeomans
Affiliations:
Management Science and Information Systems Area Faculty of Business, McMaster University Hamilton, Ontario, L8S 4M4, Canada;Management Science Area Faculty of Administrative Studies, York University North York, Ontario, M3J 1P3, Canada
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1994

Citing 7
Cited 0

Scheduling with multiple performance measures: the one-machine case

Management Science
A branch-and-bound approach to the bicriterion scheduling problem invloving total flowtime and range of lateness

Management Science
Simultaneous minimization of mean and variation flow time and waiting in single machine systems

Operations Research
Level schedules for mixed-model assembly lines in just-in-time production systems

Management Science
A note on “level schedules for mixed-model assembly lines in just-in-time production systems”

Management Science
Sequencing JIT mixed-model assembly lines

Management Science
Level schedules for mixed-model, Just-in-Time processes

Management Science

Quantified Score

Hi-index	0.98

Visualization

Abstract

A bicriterion objective for levelling the schedule of a mixed-model, Just-In-Time assembly process is examined. The two objectives considered are: minimizing the sum of deviations from a perfectly level schedule (min-sum), and minimizing the maximum deviation (min-max). This bicriterion approach combines the desirable properties of both criteria. It is shown that several Pareto optimal solutions may be efficiently determined. Furthermore, the in-core storage required to solve the bicriterion objective subject to a constraint on the maximum deviation is shown to be significantly lower than the storage required for the 'standard' min-sum problem, because there are fewer edges in the associated graph.