Comparing Lagrangian-based distributed algorithms for parallel machine scheduling problems
by L. Adacher, P. Detti
International Journal of Manufacturing Research (IJMR), Vol. 4, No. 2, 2009

Abstract: In this paper Lagrangian-based distributed algorithms for scheduling jobs on unrelated parallel machines are presented. In these algorithms, the scheduling process is the result of a cooperation process among several Decision Makers (DMs). DMs have a local knowledge of the system, and the possibility to decide which type of information to exchange each other. Our focus is to investigate the performance of different algorithms based on different knowledge degrees of the parallel machine system. The implementation issues and the effectiveness of the algorithms are analysed via simulation, in which problem instances with job dynamic arrivals are also considered.

Online publication date: Thu, 09-Apr-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Research (IJMR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com