基于包容-排斥的置换流水调度问题的中等最坏情况复杂度界

IF 1.4 4区工程技术 Q4 ENGINEERING, MANUFACTURING

Journal of Scheduling Pub Date : 2022-10-18 DOI:10.1007/s10951-022-00759-1

Olivier Ploton, V. T’kindt

引用次数: 1

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion

查看原文本刊更多论文

Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Scheduling 工程技术-工程：制造

CiteScore

3.80

自引率

10.00%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.