A matheuristic approach for the two-machine total completion time flow shop problem

DOI10.1007/S10479-011-0928-XzbMATH Open1296.90041OpenAlexW1977911671MaRDI QIDQ744632FDOQ744632

Authors: Fabio Salassa, F. 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

Recommendations

• 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: branch-and-bound algorithms based on network-flow formulation
• Two-machine flowshop scheduling with a secondary criterion
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm

zbMATH Keywords

matheuristicinteger programming formulation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Local branching
• 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
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• The Complexity of Flowshop and Jobshop Scheduling
• Variable neighborhood search: Principles and applications
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• A comprehensive review and evaluation of permutation flowshop heuristics
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• Some efficient heuristic methods for the flow shop sequencing problem
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• A matheuristic approach for the two-machine total completion time flow shop problem
• 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
• Lower bounds for minimizing total completion time in a two-machine flow shop
• A variable neighborhood search based matheuristic for nurse rostering problems

Cited In (17)

• Scheduling evacuation operations
• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
• A hybrid heuristic approach for single machine scheduling with release times
• Variants of the two machine flow shop problem connected with factorization of matrix functions
• Order scheduling with tardiness objective: improved approximate solutions
• Three-machine flow shop scheduling with overlapping waiting time constraints
• Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry
• A simple and effective algorithm for the maximum happy vertices problem
• Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
• A matheuristic approach for the two-machine total completion time flow shop problem
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Integrating matheuristics and metaheuristics for timetabling
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• A variable neighborhood search based matheuristic for nurse rostering problems
• Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation
• A multi-objective memetic algorithm for the job-shop scheduling problem

This page was built for publication: A matheuristic approach for the two-machine total completion time flow shop problem

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