A matheuristic approach for the two-machine total completion time flow shop problem
From MaRDI portal
(Redirected from Publication:744632)
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
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A matheuristic approach for the two-machine total completion time flow shop problem
- A variable neighborhood search based matheuristic for nurse rostering problems
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Local branching
- Lower bounds for minimizing total completion time in a two-machine flow shop
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- Some efficient heuristic methods for the flow shop sequencing problem
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- The Complexity of Flowshop and Jobshop Scheduling
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- The two-machine total completion time flow shop problem
- Variable neighborhood search: Principles and applications
Cited in
(19)- Scheduling evacuation operations
- Periodic chains scheduling on dedicated resources -- a crucial problem in time-sensitive networks
- 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
- A matheuristic approach for the two-machine total completion time flow shop problem
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
- 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
- Mip-based local search for permutation flowshop scheduling with makespan objective
- Integrating matheuristics and metaheuristics for timetabling
- A variable neighborhood search based matheuristic for nurse rostering problems
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
- 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)
