The no-wait flow shop with rejection

Christos Koulamas and George J. Kyparisis

International Journal of Production Research, 2021, vol. 59, issue 6, 1852-1859

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.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2020.1727042 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:59:y:2021:i:6:p:1852-1859

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2020.1727042

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().