Skip to main navigation Skip to search Skip to main content

Two- and three-stage flowshop scheduling with no-wait in process

  • T. C.Edwin Cheng
  • , Chelliah Sriskandarajah
  • , Guoqing Wang

Research output: Journal article publication › Journal article › Academic research › peer-review

Abstract

In this paper we study the time complexities of some two- and three-stage no-wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP-complete.
Original languageEnglish
Pages (from-to)367-378
Number of pages12
JournalProduction and Operations Management
Volume9
Issue number4
Publication statusPublished - 1 Jan 2000
Externally publishedYes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 9 - Industry, Innovation, and Infrastructure
    SDG 9 Industry, Innovation, and Infrastructure

Keywords

  • Algorithms
  • Complexity
  • Flowshop scheduling
  • Makespan minimization

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Management of Technology and Innovation

Fingerprint

Dive into the research topics of 'Two- and three-stage flowshop scheduling with no-wait in process'. Together they form a unique fingerprint.

Cite this