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

Authors:
Julian Scott Yeomans
Affiliations:
Management Science Area, Faculty of Administrative Studies, York University, North York, Ont., Canada M3J 1P3
Venue:
Operations Research Letters
Year:
1994

Citing 7
Cited 0

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of 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
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems

Mathematical and Computer Modelling: An International Journal
A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently Ding and Chen (1993) have published an O(nD) heuristic for the level schedule problem in mixed-model just-in-time assembly systems. They compare the results of their heuristic to the previously published procedure, M-A3H2, which they claim is the ''best existing sequencing method in the literature''. This is not, however, the case since several other optimization and heuristic procedures have previously appeared for solving the level schedule problem. This note highlights some of these prior results.