A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
From MaRDI portal
Publication:1046712
DOI10.1016/j.cor.2009.07.006zbMath1177.90196OpenAlexW2075499597MaRDI QIDQ1046712
Geraldo Robson Mateus, Martín Gómez Ravetti, Mateus Rocha de Paula
Publication date: 22 December 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1959.13/923208
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
The third comprehensive survey on scheduling problems with setup times/costs ⋮ No-wait flexible flow shop scheduling with due windows ⋮ A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem ⋮ Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non delayed relax-and-cut algorithms
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A time indexed formulation of non-preemptive single machine scheduling problems
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- Variable neighborhood search
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- An exact algorithm for the identical parallel machine scheduling problem.
- A polyhedral approach to single-machine scheduling problems.
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Lagrangean relaxation. (With comments and rejoinder).
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A branch and bound algorithm for the generalized assignment problem
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- A high quality solution constructive heuristic for flow shop sequencing
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Variable neighborhood search: Principles and applications
