Scheduling parallel machines with a single server: Some solvable cases and heuristics

Scheduling parallel machines with a single server: Some solvable cases and heuristics

0.00 Avg rating0 Votes
Article ID: iaor20022267
Country: United Kingdom
Volume: 29
Issue: 3
Start Page Number: 295
End Page Number: 315
Publication Date: Mar 2002
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
Abstract:

This paper considers the problem of scheduling two identical parallel machines with a single server which is required to carry out the job setups. Job processing can then be carried out in parallel. The objective is to minimise maximum completion time, that is makespan. The problem is NP-complete in the strong sense. An integer program formulation is presented. Two special cases, short processing times and equal length jobs, are solved. Two simple but effective O(n log n) heuristics for the general case are given and their performance is tested.

Reviews

Required fields are marked *. Your email address will not be published.