Lower bounds for the two-machine flow shop problem with time delays

DOI10.1007/978-3-319-55702-1_70zbMATH Open1375.90134OpenAlexW4299127953MaRDI QIDQ4596504FDOQ4596504

Authors: Mohamed Amine Mkadem, A. Moukrim, Mehdi Serairi 

Publication date: 1 December 2017

Published in: Operations Research Proceedings 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55702-1_70

Recommendations

• Exact method for the two-machine flow-shop problem with time delays
• Two-machine flow shop scheduling problems with minimal and maximal delays
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
• Minimising makespan in the two-machine flow-shop with release times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (5)

• Analysis of heuristics for the UET two-machine flow shop problem with time delays
• Exact method for the two-machine flow-shop problem with time delays
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Two-machine flow shop scheduling problems with minimal and maximal delays
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

This page was built for publication: Lower bounds for the two-machine flow shop problem with time delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596504)