Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling
Author:
Publisher
MDPI AG
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Link
http://www.mdpi.com/1999-4893/11/4/43/pdf
Reference25 articles.
1. Scheduling: Theory, Algorithms and Systems;Pinedo,2016
2. A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system
3. Single machine scheduling to minimize the number of early and tardy jobs
4. Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
5. Sequencing with Earliness and Tardiness Penalties: A Review
Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Innovative Optimization Algorithms for Large-Sized Industrial Scheduling Problems;Brazilian Archives of Biology and Technology;2024
2. Coronavirus Optimization Algorithms for Minimizing Earliness, Tardiness, and Anticipation of Due Dates in Permutation Flow Shop Scheduling;Arabian Journal for Science and Engineering;2023-08-31
3. A genetic iterated greedy algorithm for the blocking flowshop to minimize total earliness and tardiness;Journal of Intelligent Manufacturing;2023-06-01
4. Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system;Naval Research Logistics (NRL);2023-01-09
5. AN MCDM-BASED APPROACH TO COMPARE THE PERFORMANCE OF HEURISTIC TECHNIQUES FOR PERMUTATION FLOW-SHOP SCHEDULING PROBLEMS;INT J IND ENG-THEORY;2023
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3