The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources
Open accessAbstract
This work addresses a variant of the job shop scheduling problem in which jobs need to be transported to the machines processing their operations by a limited number of vehicles. Given that vehicles must deliver the jobs to the machines for processing and that machines need to finish processing the jobs before they can be transported, machine scheduling and vehicle scheduling are intertwined. A coordinated approach that solves these interrelated problems simultaneously improves the overall performance of the manufacturing system. In the current competitive business environment, and integrated approach is imperative as it boosts cost savings and on-time deliveries. Hence, the job shop scheduling problem with transport resources (JSPT) requires scheduling production operations and transport tasks simultaneously. The JSPT is studied considering the minimization of two alternative performance metrics, namely: makespan and exit time. Optimal solutions are found by a mixed integer linear programming (MILP) model. However, since integrated production and transportation scheduling is very complex, the MILP model can only handle small-sized problem instances. To find good quality solutions in reasonable computation times, we propose a hybrid particle swarm optimization and simulated annealing algorithm (PSOSA). Furthermore, we derive a fast lower bounding procedure that can be used to evaluate the performance of the heuristic solutions for larger instances. Extensive computational experiments are conducted on 73 benchmark instances, for each of the two performance metrics, to assess the efficacy and efficiency of the proposed PSOSA algorithm. These experiments show that the PSOSA outperforms state-of-the-art solution approaches and is very robust.
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
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Cited by
Fu, S., Li, K., Huang, H., Ma, C., Fan, Q., & Zhu, Y. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10716-3 · Cited by 287
Metadata
- Authors
- Fontes, D. B. M. M., Homayouni, S. M., & Gonçalves, J. F.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2023-05
- Volume
- 306
- Issue
- 3
- Pages
- 1140-1157
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W4295185430
- Cited by
- 241
- References
- 1
- FWCI
- 22.27
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. https://app.cochat.ai/papers/10.1016/j.ejor.2022.09.006
- The paper
- Fontes, D. B. M. M., Homayouni, S. M., & Gonçalves, J. F. (2023). A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2022.09.006
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.