Uniform machine scheduling with machine available constraints

DOI10.1007/BF02677672zbMath0957.90060MaRDI QIDQ1568243

Yong He

Publication date: 21 June 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

heuristicLPT algorithmuniform machine schedulingworst case boundlinear compound algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Approximation for scheduling on uniform nonsimultaneous parallel machines ⋮ Scheduling on uniform processors with at most one downtime on each machine

Cites Work

• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Scheduling with incompatible jobs
• Current trends in deterministic scheduling
• A note on parallel machine scheduling with non-simultaneous machine available time
• Tighter Bounds for LPT Scheduling on Uniform Processors

This page was built for publication: Uniform machine scheduling with machine available constraints