An assignment-based lower bound for a class of two-machine flow shop problems
From MaRDI portal
Publication:336351
DOI10.1016/j.cor.2013.01.001zbMath1348.90269OpenAlexW2054025900MaRDI QIDQ336351
Mohamed Kharbeche, Mohamed Haouari
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.001
Related Items (2)
The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ A mixed integer programming approach for the single machine problem with unequal release dates
Cites Work
- Unnamed Item
- Unnamed Item
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Lower bounds for minimizing total completion time in a two-machine flow shop
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- The two-machine flowshop scheduling problem with total tardiness
- A reoptimization algorithm for the shortest path problem with time windows
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- The two-machine total completion time flow shop problem
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- Note on minimizing total tardiness in a two-machine flowshop
- Optimal two- and three-stage production schedules with setup times included
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Two-machine flowshop scheduling to minimize total tardiness
- The Total Tardiness Problem: Review and Extensions
- Minimizing tardiness in a two-machine flow-shop
This page was built for publication: An assignment-based lower bound for a class of two-machine flow shop problems
