4.7 Article

Ideal schedules in parallel machine settings

期刊

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 290, 期 2, 页码 422-434

出版社

ELSEVIER
DOI: 10.1016/j.ejor.2020.08.010

关键词

Scheduling; Makespan; Total completion time; Precedence; Eligibility

资金

  1. National Research Foundation of Korea(NRF) - Korea government(MEST) [NRF-2019R1A2C1004789]

向作者/读者索取更多资源

An ideal schedule minimizes both makespan and total completion time simultaneously. If a scheduling problem always has an ideal schedule, it is called an ideal problem. This article provides a comprehensive overview of ideal schedules across different machine environments and job characteristics.
An ideal schedule is a schedule that simultaneously minimizes the two most popular scheduling objectives, namely the makespan and the total completion time. If a scheduling problem always has an ideal schedule, then the problem is called an ideal problem. We summarize ideal problem results of various scheduling problems in different machine environments and with job characteristics that include precedence constraints, release dates, processing times, eligibility constraints and preemptions. We present a comprehensive overview of ideal schedules including our new findings. (C) 2020 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据