scientific article; zbMATH DE number 1786151

MaRDI QIDQ4547475zbMATH OpenFDO

Authors Jan Pelikán

Publication date 21 August 2002

zbMATH Keywords

schedulingproduction

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Production models (90B30)

Recommendations

• Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
• A nonidentical parallel processor scheduling problem
• Parallel machine scheduling with a convex resource consumption function
• On a certain class of power- and energy-related scheduling problems
• Production scheduling of independent jobs on parallel identical processors

Cited in

(4)

• Peak demand minimization via sliced strip packing
• Peak Shaving through Resource Buffering
• Minimal Operation Time of Energy Devices
• Optimization of demand response through peak shaving

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 Q4547475)