The Distributed Assembly Permutation Flowshop Scheduling Problem
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The objective is to minimise the makespan. We present first a Mixed Integer Linear Programming model (MILP). Three constructive algorithms are proposed. Finally, a Variable Neighbourhood Descent (VND) algorithm has been designed and tested by a comprehensive ANOVA statistical analysis. The results show that the VND algorithm offers good performance to solve this scheduling problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
An exploratory technique for investigating large quantities of categorical data
Kass, G. V. (1980) · Applied Statistics · doi:10.2307/2986296 · Cited by 2,880
Metadata
- Authors
- Hatami, S., Ruiz, R., & Andrés-Romano, C.
- Venue
- International Journal of Production Research
- Publisher
- Informa UK Limited
- Published
- 2013-09
- Volume
- 51
- Issue
- 17
- Pages
- 5292-5308
- ISSN
- 0020-7543 (ISSN-L)
- 1366-588X
- OpenAlex
- W2051324103
- Cited by
- 197
- References
- 1
- FWCI
- 13.30
- Type
- journal article
- Language
- en
- Open access
- green
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: The Distributed Assembly Permutation Flowshop Scheduling Problem. https://app.cochat.ai/papers/10.1080/00207543.2013.807955
- The paper
- Hatami, S., Ruiz, R., & Andrés-Romano, C. (2013). The Distributed Assembly Permutation Flowshop Scheduling Problem. International Journal of Production Research. https://doi.org/10.1080/00207543.2013.807955
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.