The DOI matches its Crossref record.
An Adaptable Scheduling Algorithm for Flexible Flow Lines
Abstract
Consider a manufacturing line that produces parts of several types. Each part must be processed by at most one machine in each of several banks of machines. This paper presents an algorithm that schedules the loading of parts into such a line. The objective is primarily to minimize the makespan and secondarily to minimize queueing. The problem is decomposed into three subproblems and each of these is solved using a fast heuristic. The most challenging subproblem is that of finding a good loading sequence, and this is addressed using workload concepts and an approximation to dynamic programming. We make several extensions to the algorithm in order to handle limited storage capacity, expediting, and reactions to system dynamics. The algorithm was tested by computing schedules for a real production line, and the results are discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The hybrid flow shop scheduling problem
Ruiz, R., & Vázquez-Rodríguez, J. A. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.09.024 · Cited by 854
Hybrid flow shop scheduling considering machine electricity consumption cost
Luo, H., Du, B., Huang, G. Q., Chen, H., & Li, X. (2013) · International Journal of Production Economics · doi:10.1016/j.ijpe.2013.01.028 · Cited by 381
Integrating sustainability into production scheduling in hybrid flow-shop environments
Mokhtari-Moghadam, A., Pourhejazy, P., & Gupta, D. (2023) · Environmental Science and Pollution Research · doi:10.1007/s11356-023-26986-3 · Cited by 18
Metadata
- Authors
- Wittrock, R. J.
- Venue
- Operations Research
- Published
- 1988-06
- Volume
- 36
- Issue
- 3
- Pages
- 445-453
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2137272305
- Cited by
- 192
- References
- 0
- FWCI
- 20.41
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Adaptable Scheduling Algorithm for Flexible Flow Lines. https://app.cochat.ai/papers/10.1287/opre.36.3.445
- The paper
- Wittrock, R. J. (1988). An Adaptable Scheduling Algorithm for Flexible Flow Lines. Operations Research. https://doi.org/10.1287/opre.36.3.445
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.