The prize-collecting scheduling problem with deadlines

DOI10.1016/j.endm.2016.10.015zbMath1359.90043OpenAlexW2549642359MaRDI QIDQ510929

Giovanni Righini, Pierre Hosteins, Roberto Cordone

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.015

zbMATH Keywords

branch and boundinteger linear programmingsingle machine schedulingtotal tardinesshard deadlines

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• A survey on offline scheduling with rejection
• Finding the Pareto-optima for the total and maximum tardiness single machine problem
• Parallel Machine Scheduling by Column Generation

This page was built for publication: The prize-collecting scheduling problem with deadlines