引用本文:陈浩勋.Job Shop 调度的序列拉格朗日松驰法[J].控制理论与应用,1995,12(6):752~757.[点击复制]
CHEN Haoxun.A Sequential Lagrangian Relaxation Approach To Job Shop Scheduling[J].Control Theory and Technology,1995,12(6):752~757.[点击复制]
Job Shop 调度的序列拉格朗日松驰法
A Sequential Lagrangian Relaxation Approach To Job Shop Scheduling
摘要点击 1141  全文点击 469  投稿时间:1994-04-04  修订日期:1995-01-16
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  1995,12(6):752-757
中文关键词  Job Shop 调度  拉格朗日松驰法  解振荡
英文关键词  job shop scheduling  Lagrangian relaxation  solution oscillation
基金项目  
作者单位
陈浩勋 西安交通大学系统工程研究所 
中文摘要
      拉格朗日松驰法为求解复杂调度问题次最优解的一种重要方法,陆包森等人把这种方法推广到Job Shop 调度问题,但他们的方法存在解振荡问题。本文提出一种序列拉格朗日松驰法,它能避免解振荡。
英文摘要
      Lagrangian relaxation has recently emerged as an important technique for solving complex scheduling problems. Peter B. Luh and is colleagues proposed an approach to find near-optimal 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.