Uniform processor scheduling problem with nonsimultaneous available time

MaRDI QIDQ3501694zbMATH OpenFDO

Authors Rui Shi, Chuanli Zhao

Publication date 3 June 2008

zbMATH Keywords

processoroptimal schedule

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Scheduling on uniform nonsimultaneous parallel machines
• Uniform machine scheduling with machine available constraints
• On a special case of uniform processor scheduling
• Approximation for scheduling on uniform nonsimultaneous parallel machines
• An On-Line Algorithm for Some Uniform Processor Scheduling

Cited in

(3)

• scientific article; zbMATH DE number 4162635 (Why is no real title available?)
• Scheduling on uniform processors with at most one downtime on each machine
• Scheduling on uniform nonsimultaneous parallel machines

This page was built for publication: Uniform processor scheduling problem with nonsimultaneous available time

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