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

作者：

Highlights：

• Scheduling a permutation flow shop to minimize earliness and tardiness is addressed.

• The use of unforced idle time is considered.

• It is shown that unforced idle time only needs to be scheduled on the last machine.

• Several dispatching heuristics are tested.

• Several procedures are developed that result in improved solutions.

摘要

•Scheduling a permutation flow shop to minimize earliness and tardiness is addressed.•The use of unforced idle time is considered.•It is shown that unforced idle time only needs to be scheduled on the last machine.•Several dispatching heuristics are tested.•Several procedures are developed that result in improved solutions.

论文关键词：Scheduling,Heuristics,Flow Shop,Earliness and Tardiness

论文评审过程：Received 25 July 2018, Revised 19 October 2018, Accepted 5 November 2018, Available online 7 November 2018, Version of Record 12 November 2018.

论文官网地址：https://doi.org/10.1016/j.eswa.2018.11.007