An exact quadratic programming approach based on convex reformulation for seru scheduling problems
From MaRDI portal
Publication:6078600
DOI10.1002/nav.22078zbMath1525.90228MaRDI QIDQ6078600
Xiaoling Song, Yong Yin, Xue Gong, Zhe Zhang, Benjamin Lev, Xiaoyang Zhou
Publication date: 24 October 2023
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Related Items (4)
Column generation for service assignment in cloud-based manufacturing ⋮ An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Maximizing the throughput of a rotating Seru with nonpreemptive discrete stations
Cites Work
- Unnamed Item
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Experiments in quadratic 0-1 programming
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
- A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Convex quadratic and semidefinite programming relaxations in scheduling
- Scheduling parallel machines with inclusive processing set restrictions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness
- An implementation framework for seru production
- Parallel machine scheduling with job assignment restrictions
- On Quadratic Programming
- Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand
This page was built for publication: An exact quadratic programming approach based on convex reformulation for seru scheduling problems
