The complexity and approximation algorithm of three parallel machines scheduling problem with servers

The complexity and approximation algorithm of three parallel machines scheduling problem with servers

0.00 Avg rating0 Votes
Article ID: iaor20013890
Country: China
Volume: 15
Issue: 2
Start Page Number: 229
End Page Number: 234
Publication Date: Jun 2000
Journal: Applied Mathematics (A Journal of Chinese Universities)
Authors: ,
Abstract:

The problem of scheduling n jobs on 3 parallel identical machines which are tended by two servers is studied. In such a parallel machine system, before a machine begins processing a job, the server has to set up the machine, and then the machine can process the job on its own. The objective is to minimize the makespan. The problem is NP-C. A heuristic method under on-line and off-line conditions is developed respectively. And the worst-case bounds are given.

Reviews

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