Abstract
We study a scheduling problem in a multipurpose machine environment where every job can be processed by a subset of the machines operated in parallel, with the objective of minimizing makespan. We develop lower bounds, heuristic algorithms, and a branch-and-bound procedure. We perform an extensive computational experiment to assess how much flexibility is enough to render the multipurpose machine system equally efficient to an equivalent system of parallel identical machines. We find that very small amounts of flexibility appropriately distributed across processors provide nearly the same makespan performance as a system of fully flexible parallel machines.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have