Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
From MaRDI portal
Publication:1038328
DOI10.1016/j.ejor.2009.03.049zbMath1176.90241OpenAlexW2073779766MaRDI QIDQ1038328
Marie-Christine Plateau, Yasmin A. Rios-Solis
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.049
Related Items
Proximal point algorithms for nonsmooth convex optimization with fixed point constraints ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Scheduling identical parallel machines to minimize total weighted completion time
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Parallel machine earliness and tardiness scheduling with proportional weights
- Exponential neighborhood search for a parallel machine scheduling problem
- Parallel Machine Scheduling by Column Generation
- Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
- Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
- Convex quadratic and semidefinite programming relaxations in scheduling
- Sequencing with Earliness and Tardiness Penalties: A Review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Solving Parallel Machine Scheduling Problems by Column Generation
- CSDP, A C library for semidefinite programming
- An Interior-Point Method for Semidefinite Programming
- Computationally Related Problems
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
