A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
作者
关键词
Unrelated parallel machine scheduling, Scheduling with a common server, Simulated annealing, Tabu search, Sequence-dependent setup times, Dispatching rule
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started