Back to Search
Start Over
The no-wait flow shop with rejection.
- Source :
- International Journal of Production Research; Mar2021, Vol. 59 Issue 6, p1852-1859, 8p
- Publication Year :
- 2021
-
Abstract
- We consider the no-wait flow shop scheduling problem with rejection. We first show how to augment the travelling salesman problem formulation for the no-wait flow shop minimum makespan problem to incorporate the rejection option. We then focus on polynomially solvable cases by considering problems with ordered jobs. We present a third-order polynomial-time dynamic programming algorithm to minimise the sum of makespan and total rejection cost and faster quadratic algorithms for two special cases. We also present a third-order polynomial-time dynamic programming algorithm to minimise the sum of total completion time and total rejection cost with ordered jobs. We also exploit the duality between no-wait and no-idle flow shops to determine which operations to outsource in a no-idle flow shop with an outsourcing option. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00207543
- Volume :
- 59
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- International Journal of Production Research
- Publication Type :
- Academic Journal
- Accession number :
- 149413661
- Full Text :
- https://doi.org/10.1080/00207543.2020.1727042