Decision support for unrelated parallel machine scheduling with discrete controllable processing times
A scheduling problem involving discrete controllable processing times is considered. The objectives are to minimize some scheduling criteria. We develop polynomial time algorithms for the considered problems. We further consider the NP-hard problem of the makespan case. An integer programming and a heuristic are presented to solve the NP-hard problem.
scheduling discrete controllable processing times unrelated parallel-machine