Title: Comparing Lagrangian-based distributed algorithms for parallel machine scheduling problems

Authors: L. Adacher, P. Detti

Addresses: Dipartimento di Informatica e Automazione – Universita di Roma Tre, via della vasca navale, 79 – 00146 Roma, Italy. ' Dipartimento di Ingegneria Dell'informazione, Universita di Siena, via Roma, 56 – 53100 Siena, Italy

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.

Keywords: distributed decision algorithms; parallel machine scheduling; Lagrangian relaxation; cooperation; simulation.

DOI: 10.1504/IJMR.2009.024537

International Journal of Manufacturing Research, 2009 Vol.4 No.2, pp.189 - 202

Available online: 09 Apr 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article