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 language | English |
|---|---|
| Pages (from-to) | 367-378 |
| Number of pages | 12 |
| Journal | Production and Operations Management |
| Volume | 9 |
| Issue number | 4 |
| Publication status | Published - 1 Jan 2000 |
| Externally published | Yes |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver