An adaptive shuffled frog-leaping algorithm for parallel batch processing machines scheduling with machine eligibility in fabric dyeing process
| Year of publication: |
2024
|
|---|---|
| Authors: | Lei, Deming ; Dai, Tao |
| Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 62.2024, 21, p. 7704-7721
|
| Subject: | Batch processing machine | fabric dyeing process | machine eligibility | parallel machine scheduling | shuffled frog-leaping algorithm | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Produktionssteuerung | Production control | Theorie | Theory | Rechnerbetrieb | Computer operations | Künstliche Intelligenz | Artificial intelligence |
-
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
-
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Shioura, Akiyoshi, (2024)
-
A multi-agent system for the weighted earliness tardiness parallel machine problem
Polyakovskiy, Sergey, (2014)
- More ...
-
Managing cloud security in the presence of strategic hacker and joint responsibility
Wu, Yong, (2024)
-
Liu, Yunxia, (2024)
-
Information security outsourcing strategies in the supply chain considering security externality
Wu, Yong, (2025)
- More ...