Multi Project Scheduling and Material Planning Using Lagrangian Relaxation Algorithm

2021 ◽  
Vol 20 (4) ◽  
pp. 580-587
Author(s):  
Alim Al Ayub Ahmed ◽  
Ngakan Ketut Acwin Dwijendra ◽  
NareshBabu Bynagari ◽  
A.K. Modenov ◽  
M. Kavitha ◽  
...  
Keyword(s):  
Lagrangian Relaxation ◽  
Project Scheduling ◽  
Relaxation Algorithm ◽  
Lagrangian Relaxation Algorithm

Hybrid Flowshop Scheduling with Finite Transportation Capacity

2011 ◽  
Vol 65 ◽  
pp. 574-578 ◽  
Author(s):  
Hua Xuan
Keyword(s):  
Lagrangian Relaxation ◽  
Programming Model ◽  
Optimal Schedule ◽  
Release Time ◽  
Flowshop Scheduling ◽  
Hybrid Flowshop ◽  
Relaxation Algorithm ◽  
Hybrid Flowshop Scheduling ◽  
Transportation Capacity ◽  
Lagrangian Relaxation Algorithm

This paper studies a class of hybrid flowshop scheduling problem characterized by release time, transportation time and transportation capacity of one unit for each transporter. This problem is formulated as an integer programming model and a Lagrangian relaxation algorithm is designed to solve it. Testing results on problems of small to medium sizes show that the Lagrangian relaxation algorithm can obtain an acceptable near optimal schedule within a shorter CPU time.

Sign in / Sign up

Export Citation Format

Share Document