454
Views
5
CrossRef citations to date
0
Altmetric
Research Article

Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed

&
Pages 5488-5504 | Received 21 Dec 2020, Accepted 17 Jul 2021, Published online: 30 Aug 2021

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (3)

Fuqing Zhao, Hui Zhang, Ling Wang, Tianpeng Xu, Ningning Zhu & Jonrinaldi Jonrinaldi. (2024) A multi-objective discrete differential evolution algorithm for energy-efficient distributed blocking flow shop scheduling problem. International Journal of Production Research 62:12, pages 4226-4244.
Read now
Yiwei Jiang, Haodong Yuan, Ping Zhou, T. C. E. Cheng & Min Ji. (2023) Two parallel-machine scheduling with maximum waiting time for an emergency job. International Journal of Production Research 0:0, pages 1-12.
Read now
Hyeon-Il Kim & Dong-Ho Lee. (2023) Scheduling algorithms for multi-stage flow shops with reworks under overlapped queue time limits. International Journal of Production Research 61:20, pages 6908-6922.
Read now

Articles from other publishers (2)

Sujun Zhang & Xingsheng Gu. (2023) A discrete whale optimization algorithm for the no-wait flow shop scheduling problem. Measurement and Control 56:9-10, pages 1764-1779.
Crossref
Ismet Karacan, Ozlem Senvar & Serol Bulkan. (2023) A Novel Parallel Simulated Annealing Methodology to Solve the No-Wait Flow Shop Scheduling Problem with Earliness and Tardiness Objectives. Processes 11:2, pages 454.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.