Minimizing makespan in a multimode multiprocessor shop scheduling problem

✍ Scribed by Lucio Bianco; Paolo Dell'Olmo; Stefano Giordani; Maria Grazia Speranza

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 255 KB
• Volume: 46
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/(sici)1520-6750(199912)46:8<893::aid-nav2>3.0.co;2-7

✦ Synopsis

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is N P-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems.