Lagrangian approach to minimize makespan of non-identical parallel batch processing machines
Author:
Publisher
Elsevier BV
Subject
General Engineering,General Computer Science
Reference20 articles.
1. Minimizing total completion time on batch processing machine;Chandru;International Journal of Production Research,1993
2. Minimizing makespan on parallel batch processing machines;Chang;International Journal of Production Research,2004
3. An Improvement of the lagrangian relaxation approach for job shop scheduling: A dynamic programming method;Chen;IEEE Transactions on Robotics and Automation,1998
4. A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines;Damodaran;The International Journal of Advanced Manufacturing Technology,2012
5. Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times;Damodaran;International Journal of Advanced Manufacturing Technology,2010
Cited by 20 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A multi-level action coupling reinforcement learning approach for online two-stage flexible assembly flow shop scheduling;Journal of Manufacturing Systems;2024-10
2. Co-Evolutionary Algorithm for Two-Stage Hybrid Flow Shop Scheduling Problem with Suspension Shifts;Mathematics;2024-08-20
3. Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms;Computers & Operations Research;2024-08
4. A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints;Operational Research;2024-04-13
5. Study on flexible job shop scheduling problem considering energy saving;Journal of Intelligent & Fuzzy Systems;2024-03-05
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3