No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with a Single Server and Separable Setup Times to Minimize Total Tardiness-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with a Single Server and Separable Setup Times to Minimize Total Tardiness

Published:2023-07-03 Issue: Volume: Page:
ISSN:
Container-title:2023 9th International Conference on Control, Decision and Information Technologies (CoDIT)
language:
Short-container-title:

Author:

Medouar Fouad¹,Elidrissi Abdelhak²,Benmansour Rachid¹,Gupta Jatinder ND³

Affiliation:

1. National Institute of Statistics and Applied Economics (SI2M laboratory, INSEA),Rabat,Morocco

2. Rabat Business School, International University of Rabat,Rabat, Parc Technopolis,Morocco

3. College of Business, The University of Alabama in Huntsville,Huntsville,AL,USA,35899

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10284032/10284045/10284144.pdf?arnumber=10284144

Reference17 articles.

1. Minimizing Total Tardiness on One Machine is NP-Hard

2. Studying the effect of server side-constraints on the makespan of the no-wait flow-shop problem with sequence-dependent set-up times

3. On the facial structure of scheduling polyhedra

4. Mathematical formulations for the parallel machine scheduling problem with a single server

5. A survey of scheduling problems with no-wait in process

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP