Title: Implementation of scheduling algorithm for optimisation by Lagrangian decomposition model
Authors: S. Maheswari; C. Vijayalakshmi
Addresses: Department of Mathematics, Sathyabama University, Jeppiaar Nagar, Rajiv Gandhi Road, Chennai 600 119, Tamil Nadu, India ' Department of Mathematics, Sathyabama University, Jeppiaar Nagar, Rajiv Gandhi Road, Chennai 600 119, Tamil Nadu, India
Abstract: This paper mainly deals with the design and analysis of Lagrangian model using cyclic scheduling algorithm. An integer programming (IP) model is formulated and then decomposed by using Lagrangian relaxation technique. Two approaches were implemented, the first approach is based on the relaxation of the preference constraints and the second approach is based on the relaxation of the demand constraints. Since proper bounds were not obtained by relaxing the preference constraints, a solution methodology is developed based on the relaxation of demand constraints. Many researchers have discussed the different type of methods, such as bundle method, heuristic and variable fixing. A duality gap exists between the lower bound and the objective function value provided by an IP feasibility heuristic. A variable fixing scheme is introduced for the convergence criteria. Based on the numerical calculations and graphical representations, the minimum cost is obtained to cover the uncovered shifts.
Keywords: cyclic scheduling; preference scheduling; electrical engineering rostering; Lagrangian relaxation; bundle method; optimisation; Lagrangian decomposition modelling.
International Journal of Operational Research, 2012 Vol.14 No.1, pp.70 - 93
Published online: 11 Jan 2015 *
Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article