Flow-shop scheduling with exact delays to minimize makespan

Mostafa Khatami, Amir Salehipour, T. C.E. Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

5 Citations (Scopus)

Abstract

The flow-shop scheduling problem with exact delays is generalization of no-wait flow-shop scheduling in which an exact delay exists between the consecutive tasks of each job. The problem with distinct delays to minimize the makespan is strongly NP-hard even for the two-machine case with unit execution time tasks. Providing polynomial-time solutions for special cases of the problem, we show that the two-machine permutation flow-shop case is solvable in O(nlogn) time, while the case with more than two machines is strongly NP-hard. We also show that the multi-machine case with delays following the ordered structure possesses the pyramidal-shaped property and propose an O(n2)-time dynamic program to solve it. We further improve the time complexity of the solution algorithm to O(nlogn) under certain conditions.

Original languageEnglish
Article number109456
JournalComputers and Industrial Engineering
Volume183
DOIs
Publication statusPublished - Sept 2023

Keywords

  • Coupled task
  • Exact delays
  • Flow-shop
  • Pyramidal property
  • Scheduling

ASJC Scopus subject areas

  • General Computer Science
  • General Engineering

Fingerprint

Dive into the research topics of 'Flow-shop scheduling with exact delays to minimize makespan'. Together they form a unique fingerprint.

Cite this