Selection of cutting conditions for power constrained parallel machine scheduling
This study investigates a parallel machine scheduling problem for a manufacturing system with a bounded power demand peak. The problem is to simultaneously determine proper cutting conditions for various jobs and assign them to machines for processing under the condition that power consumption never exceed the electricity load limit. A two-stage heuristic approach is proposed to solve the production scheduling problem with the goal of minimizing makespan. With the proposed approach for production scheduling, the power demand is balanced perfectly without exceeding the given upper bound.
cutting conditions parallel machine scheduling power demand genetic algorithm