ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Real-World Extensions To Scheduling Algorithms Based On Lagrangian Relaxation

Narahari, Y and Srigopal, R (1996) Real-World Extensions To Scheduling Algorithms Based On Lagrangian Relaxation. In: Sadhana-Academy Proceedings In Engineering Sciences, 21 (04). pp. 415-433.

[img]
Preview
PDF
nn.pdf - Published Version

Download (1549Kb)
Official URL: http://www.ias.ac.in/j_archive/sadhana/volindex.ht...

Abstract

Recently, efficient scheduling algorithms based on Lagrangian relaxation have been proposed for scheduling parallel machine systems and job shops. In this article, we develop real-world extensions to these scheduling methods. In the first part of the paper, we consider the problem of scheduling single operation jobs on parallel identical machines and extend the methodology to handle multiple classes of jobs, taking into account setup times and setup costs, The proposed methodology uses Lagrangian relaxation and simulated annealing in a hybrid framework, In the second part of the paper, we consider a Lagrangian relaxation based method for scheduling job shops and extend it to obtain a scheduling methodology for a real-world flexible manufacturing system with centralized material handling.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Indian Academy Sciences.
Keywords: jobshop scheduling;Lagrangian relaxation;simulated annealing;flexible manufacturing systems;weighted tardiness;subgradient methods.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 03 Dec 2009 11:45
Last Modified: 19 Sep 2010 05:28
URI: http://eprints.iisc.ernet.in/id/eprint/19391

Actions (login required)

View Item View Item