×

A comment on “A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems”. (English) Zbl 0823.90057

Summary: 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.

MSC:

90B30 Production models
90B35 Deterministic scheduling theory in operations research
Full Text: DOI

References:

[1] Balas, E.; Miller, D.; Pekny, J.; Toth, P., A parallel shortest augmenting path algorithm for the assignment problem, (MSRR No. 552 (1989), GSIA, Carnegie-Mellon University: GSIA, Carnegie-Mellon University Pittsburgh) · Zbl 0799.68111
[2] Burkard, R.; Derigs, U., Assignment and Matching Problems: Solution Methods with FORTRAN Programs (1980), Springer: Springer Berlin · Zbl 0436.90069
[3] Ding, F.-Y.; Cheng, L., A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems, Oper. Res. Lett., 13, 1, 27-36 (1993) · Zbl 0771.90050
[4] Ding, F.-Y.; Cheng, L., An effective mixed-model assembly lines sequencing Heuristic for just-in-time production systems, J. Oper. Management, 11, 1, 45-50 (1993)
[5] Garey, M.; Tarjan, R.; Wilfong, G., One-processor scheduling with symmetric early and tardiness penalties, Math. Oper. Res., 13, 330-344 (1988) · Zbl 0671.90033
[6] Groeflin, H.; Luss, H.; Rosenwein, M.; Wahls, E., Final assembly sequencing for just-in-time manufacturing, Internat. J. Prod. Res., 27, 2, 199-213 (1989)
[7] Inman, R.; Bulfin, R., Sequencing JIT mixed-model assembly lines, Management Sci., 37, 7, 901-904 (1991) · Zbl 0729.90672
[8] Kubiak, W., Minimizing variation of production rates in just-in-time systems: A survey, European J. Oper. Res., 66, 259-271 (1993) · Zbl 0771.90051
[9] Kubiak, W.; Sethi, S., Optimal level schedules for flexible assembly lines in JIT production systems (1989), Faculty of Management, University of Toronto, Working paper
[10] Kubiak, W.; Sethi, S., A note on Level schedules for mixed-model assembly lines in just-in-time production system, Management Sci., 37, 1, 121-122 (1991) · Zbl 0727.90033
[11] Miltenburg, J., Level schedules for mized-model assembly lines in just-in-time production systems, Management Sci., 32, 2, 192-207 (1989) · Zbl 0666.90040
[12] Miltenburg, J.; Goldstein, T., Developing production schedules which balance part usage and smotth production loads in just-in-time productions system, Naval Res. Logist., 38, 6, 893-910 (1991) · Zbl 0729.90951
[13] Miltenburg, J.; Sinnamon, G., Scheduling mixed-model, multi-level just-in-time production systems, Internat. J. Prod. Res., 27, 9, 1487-1509 (1989)
[14] Miltenburg, J.; Steiner, G.; Yeomans, S., A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems, Math. Comput. Modelling, 13, 3, 57-66 (1990) · Zbl 0692.90058
[15] Yeomans, J. S., Optimal level schedules for mized-model, just-in-time assembly systems, (Ph.D. Dissertation (1992), Dept. of Management Science and Information Systems, McMaster University: Dept. of Management Science and Information Systems, McMaster University Hamilton, Ont)
[16] Yeomans, J. S.; Steiner, G., Optimal scheduling of mixed-model, just-in-time assembly lines, (presented at the TIMS/ORSA Nashville Conference (1991)) · Zbl 0851.68090
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.