Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
Author:
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Link
http://link.springer.com/content/pdf/10.1007/BF01585935.pdf
Reference33 articles.
1. T.S. Abdul-Razaq, C.N. Potts and L.N. Van Wassenhove, “A survey of algorithms for the single machine total weighted tardiness scheduling problem,”Discrete Applied Mathematics 26 (1990) 235–253.
2. D. Adolphson and T.C. Hu, “Optimal linear ordering,”SIAM Journal of Applied Mathematics 25 (1973) 403–423.
3. R.W. Conway, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley, Reading, MA, 1967).
4. M.E. Dyer and L.A. Wolsey, “Formulating the single-machine sequencing problem with release dates as a mixed integer program,”Discrete Applied Mathematics 26 (1990) 255–270.
5. M.L. Fisher, “The Lagrangian relaxation method for solving integer programming problems,”Management Science 27 (1981) 1–18.
Cited by 34 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem;Expert Systems with Applications;2020-11
2. Precedence theorems and dynamic programming for the single-machine weighted tardiness problem;European Journal of Operational Research;2019-01
3. The Total Weighted Tardiness of Tasks Minimization on a Single Machine;Combinatorial Optimization Problems in Planning and Decision Making;2018-09-25
4. Precedence Theorems and Dynamic Programming for the Single-Machine Weighted Tardiness Problem;SSRN Electronic Journal;2017
5. Minimizing Total Completion Time in Flowshop with Availability Constraint on the First Machine;Annals of Computer Science and Information Systems;2016-10-02
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3