Metaheuristics for optimizing unrelated parallel machines scheduling with unreliable resources to minimize makespan
Sign Up to like & getrecommendations! Published in 2022 at "Advances in Mechanical Engineering"
DOI: 10.1177/16878132221097023
Abstract: Parallel machines scheduling problems with continuous availability of machines are NP-hardness (non-deterministic polynomial-time hardness) and have become very popular for the last decade; there is still very limited literature on this problem. The purpose of… read more here.
Keywords: problem; time; machines scheduling; proposed metaheuristics ... See more keywords