Implementation of scheduling algorithm for optimisation by Lagrangian decomposition model Online publication date: Sun, 11-Jan-2015
by S. Maheswari; C. Vijayalakshmi
International Journal of Operational Research (IJOR), Vol. 14, No. 1, 2012
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Operational Research (IJOR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook