A decomposition algorithm for the single machine total tardiness problem
Author:
Publisher
Elsevier BV
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference9 articles.
1. Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks;Baker;Operations Res.,1978
2. One-machine sequencing to minimize certain functions of job tardiness;Emmons;Operations Res.,1969
3. A dual algorithm for the one-machine scheduling problem;Fisher;Math. Programming,1976
4. A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness;Lawler;Ann. Discrete Math.,1977
5. The time-dependent traveling salesman problem and applications to the tardiness problem in one-machine scheduling;Picard;Operations Res.,1978
Cited by 231 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation;Computers & Operations Research;2024-12
2. Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach;European Journal of Operational Research;2024-10
3. Scheduling analysis of automotive glass manufacturing systems subject to sequence-independent setup time, no-idle machines, and permissive maximum total tardiness constraint;Engineering Applications of Artificial Intelligence;2024-07
4. Theoretical analysis and methods of rapid evaluation: Solving the blocking flowshop group scheduling problem with the total flow time and total tardiness time criteria;Swarm and Evolutionary Computation;2024-07
5. Scheduling in a Simple Assembly Robotics Cell to Minimize Earliness and Tardiness;INGENIERIA-BOGOTA;2024
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3