A polytime algorithm based on a primal LP model for the scheduling problem 1|pmtn;p_j=2;r_j| w_jC_j

zbMATH Open1341.90039MaRDI QIDQ3178057FDOQ3178057

Authors Harmen W. Bouma, Boris Goldengorin 

Publication date 8 July 2016

zbMATH Keywords

release datestotal weighted completion timepreemptive schedulingequal-length jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 702559
• Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
• MP or not MP: that is the question
• scientific article; zbMATH DE number 4170623
• An exact algorithm for the preemptive single machine scheduling of equal-length jobs

Cited In (3)

• MP or not MP: that is the question
• Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
• The affine hull of the schedule polytope for servicing identical requests by parallel devices

This page was built for publication: A polytime algorithm based on a primal LP model for the scheduling problem \(1|pmtn;p_j=2;r_j|\sum w_jC_j\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178057)