Tailoring Bounded Instances for the Job Shop Scheduling Problem Through Unified Particle Swarm Optimization
- DOI
- 10.1007/978-3-031-96255-4_4
- Published
- 2025
- Container
- Lecture Notes in Computer Science
- Publisher
- Springer Nature Switzerland
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1007/978-3-031-96255-4_4,
title = {Tailoring Bounded Instances for the Job Shop Scheduling Problem Through Unified Particle Swarm Optimization},
author = {Alonso Vela Morales and José Carlos Ortiz-Bayliss and Jorge M. Cruz-Duarte and Ivan Amaya},
year = {2025},
journal = {Lecture Notes in Computer Science},
doi = {10.1007/978-3-031-96255-4_4},
url = {https://doi.org/10.1007/978-3-031-96255-4_4}
}RIS
TY - JOUR TI - Tailoring Bounded Instances for the Job Shop Scheduling Problem Through Unified Particle Swarm Optimization AU - Alonso Vela Morales AU - José Carlos Ortiz-Bayliss AU - Jorge M. Cruz-Duarte AU - Ivan Amaya PY - 2025 JO - Lecture Notes in Computer Science DO - 10.1007/978-3-031-96255-4_4 UR - https://doi.org/10.1007/978-3-031-96255-4_4 ER -
APA
Morales, A. V., Ortiz-Bayliss, J. C., Cruz-Duarte, J. M., & Amaya, I. (2025). Tailoring Bounded Instances for the Job Shop Scheduling Problem Through Unified Particle Swarm Optimization. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-031-96255-4_4
Source records
- crossref · retrieved 2026-09-25T13:10:57.251Z