The paper addresses the scheduling problem of n jobs on m identical parallel machines to minimize the maximumjob cost, subjected to arbitrary precedence constraints, denoted by Pm|prec|fmax. In this paper, a mathematical modelis presented and a new heuristic which combines Lawler’s optimal single machine sequencing rule and Job-orientedList Scheduling (JLS) algorithm is developed. The performance of the proposed heuristic is tested on both small andlarge instances. The computational results show that the proposed heuristic is computationally efficient andoutperforms an existing algorithm.
展开▼
