Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed

IF 7.5 1区计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Expert Systems with Applications Pub Date : 2019-04-01 DOI:10.1016/j.eswa.2018.11.007

Jeffrey Schaller , Jorge M.S. Valente

引用次数: 17

Abstract

This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimizing total earliness and tardiness. Unforced idle time is considered in order to reduce the earliness of jobs. It is shown how unforced idle time can be inserted on the final machine. Several dispatching heuristics that have been used for the problem without unforced idle time were modified and tested. Several procedures were also developed that conduct a second pass to develop a sequence using dispatching rules. These procedures were also tested and were found to result in better solutions.

查看原文本刊更多论文

在允许非强迫空闲时间的情况下，排列流车间中调度作业以最小化总提前和延迟的启发式方法

本文以最小化总提前和延迟为目标，研究了排列流车间中的作业调度问题。为了减少工作的提前性，考虑了未强制的空闲时间。它显示了如何在最终机器上插入非强制空闲时间。在没有非强制空闲时间的情况下，对用于该问题的几种调度启发式方法进行了修改和测试。还开发了几个程序，进行第二次通行，以使用调度规则开发序列。还对这些程序进行了测试，发现它们产生了更好的解决方案。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Expert Systems with Applications 工程技术-工程：电子与电气

CiteScore

13.80

自引率

10.60%

发文量

2045

审稿时长

8.7 months

期刊介绍： Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.