A matheuristic approach for the two-machine total completion time flow shop problem
From MaRDI portal
Publication:744632
DOI10.1007/s10479-011-0928-xzbMath1296.90041OpenAlexW1977911671MaRDI QIDQ744632
Fabio Salassa, Frederico Della Croce, Andrea Grosso
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2318/143643
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ A simple and effective algorithm for the maximum happy vertices problem ⋮ Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ Scheduling evacuation operations ⋮ A hybrid heuristic approach for single machine scheduling with release times ⋮ Integrating matheuristics and metaheuristics for timetabling ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ A variable neighborhood search based matheuristic for nurse rostering problems ⋮ A worker constrained flexible job shop scheduling problem with sequence-dependent setup times ⋮ Order scheduling with tardiness objective: improved approximate solutions ⋮ Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation
Cites Work
- A variable neighborhood search based matheuristic for nurse rostering problems
- A matheuristic approach for the two-machine total completion time flow shop problem
- Lower bounds for minimizing total completion time in a two-machine flow shop
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- The two-machine total completion time flow shop problem
- Local branching
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Variable neighborhood search: Principles and applications
