Scheduling with earliness-tardiness penalties and parallel machines

DOI10.1007/s10288-007-0055-3zbMath1151.90430OpenAlexW1996550953MaRDI QIDQ941007

Yasmin A. Rios-Solis

Publication date: 4 September 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0055-3

zbMATH Keywords

schedulingearliness-tardinessparallel machines

Mathematics Subject Classification ID

Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Exponential neighborhood search for a parallel machine scheduling problem
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
• Convex quadratic and semidefinite programming relaxations in scheduling

This page was built for publication: Scheduling with earliness-tardiness penalties and parallel machines