scientific article; zbMATH DE number 6007890

MaRDI QIDQ3115252zbMATH OpenFDO

Authors R. Yu. Simanchev, I. V. Urazova

Publication date 20 February 2012

zbMATH Keywords

integer programmingpolytopescheduling problemprecedencesupporting inequality

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling jobs on identical and uniform processors revisited
• The affine hull of the schedule polytope for servicing identical requests by parallel devices
• Optimal Scheduling of Tasks on Identical Parallel Processors
• A new polynomial algorithm for a parallel identical scheduling problem
• Scheduling identical jobs on uniform parallel machines
• On the complexity of scheduling problems with a fixed number of parallel identical machines
• Scheduling equal-length jobs on identical parallel machines
• A polynomial time approximation scheme for general multiprocessor job scheduling
• Batch scheduling of identical jobs on parallel identical machines

Cited in

(3)

• The branch and cut method for the clique partitioning problem
• Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests
• The affine hull of the schedule polytope for servicing identical requests by parallel devices

This page was built for publication:

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