Real-world extensions to scheduling algorithms based on Lagrangian relaxation

DOI10.1007/BF02745567zbMath1009.90050MaRDI QIDQ5955791

Yadati Narahari, R. Srigopal

Publication date: 18 February 2002

Published in: Sādhanā (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationflexible manufacturing systemssimulated annealingjobshop schedulingsubgradient methodsweighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• The discrete lot-sizing and scheduling problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Job Shop Scheduling by Simulated Annealing
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• A dual algorithm for the one-machine scheduling problem

This page was built for publication: Real-world extensions to scheduling algorithms based on Lagrangian relaxation