Real-World Extensions to a Production Scheduling Algorithm Based on Lagrangian Relaxation

In this article, we develop three eflcient extensions to a recent production scheduling algorithm based on Lagrangian relaxation [9]. These extensions handle the following real-world features: 0 stochastic availability of raw material, 0 reworking and scrapping of parts, and 0 incorporating set-up costs and set-up times in the Scheduling of multiclass manufacturing systems Thefirst two extensions yield on-lane algorithms which are illustrated using a 89-job scheduling problem. The t h i d extension uses an algorithmic procedure to inserl switchovers to obtain a good schedule and is illustrated for a two-class, 89-job scheduling problem.

• Type: Conference
• Year: 1994
• Where: ICRA
• Authors: Y. Narahari, Sundar Ram Vedula
• Keywords: 89-job Scheduling Problem, ICRA 1994, Incorporating Set-up Costs, Production Scheduling Algorithm, Robotics