Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
From MaRDI portal
Publication:1761154
DOI10.1016/j.cor.2011.11.005zbMath1251.90195OpenAlexW2042513519MaRDI QIDQ1761154
Jorge M. S. Valente, Jeffrey E. Schaller
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/2883
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Soliton solutions to resonant nonlinear Schrödinger's equation with time-dependent coefficients by trial solution approach ⋮ Exact traveling wave solutions and bifurcations of the Biswas-Milovic equation ⋮ Single machine scheduling problem with interval processing times to minimize mean weighted completion time ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ A note on reverse scheduling with maximum lateness objective ⋮ Learning-augmented heuristics for scheduling parallel serial-batch processing machines ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ On solving two higher-order nonlinear PDEs describing the propagation of optical pulses in optic fibers using the \((\frac{G^\prime}{G},\frac{1}{G})\)-expansion method
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Improved heuristics for the \(n\)-job single-machine weighted tardiness problem
- Minimizing the weighted sum of squared tardiness on a single machine
- Minimizing the sum of squares lateness on a single machine
- A weighted modified due date rule for sequencing to minimize weighted tardiness
- Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
- AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
- Dominance and Decomposition Heuristics for Single Machine Scheduling
This page was built for publication: Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
