Job　Shop调度的序列拉格朗日松驰法  

A Sequential Lagrangian Relaxation Approach To Job Shop Scheduling

作　　者：陈浩勋[1] 

机构地区：[1]西安交通大学系统工程研究所

出　　处：《控制理论与应用》1995年第6期752-757,共6页Control Theory & Applications

摘　　要：拉格朗日松驰法为求解复杂调度问题次最优解的一种重要方法，陆宝森等人把这种方法推广到ＪｏｂＳｈｏｐ调度问题，但他们的方法存在解振荡问题．本文提出一种序列拉格朗日松驰法。Lagrangian relaxation has recently emerged as an important technique for solving complex scheduling problems. Peter B. Luh and his colleagues proposed an approach to find nearoptimal solutions of job shop scheduling problems based on Lagrangian relaxation. Unfortunately,the approach exhibits solution oscillation in its iterative algorithm. In this paper,we propose a sequential Lagrangian relaxation approach to job shop scheduling problems,which can avoid the solution oscillation.

关 键 词：调度问题 JOB-SHOP调度 拉格朗日松驰法 

分 类 号：O224[理学—运筹学与控制论]