A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 38-47
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterionComputers & Operations Research, 2009
- Lower bounds for minimizing total completion time in a two-machine flow shopJournal of Scheduling, 2006
- The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithmEuropean Journal of Operational Research, 2004
- Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization ProblemsJournal of Heuristics, 2004
- Local branchingMathematical Programming, 2003
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problemEuropean Journal of Operational Research, 2002
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- The two-machine total completion time flow shop problemEuropean Journal of Operational Research, 1996
- Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound ApproachA I I E Transactions, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976