Uniform processor scheduling problem with nonsimultaneous available time

zbMATH Open1150.90358MaRDI QIDQ3501694FDOQ3501694

Authors: Rui Shi, Chuanli Zhao 

Publication date: 3 June 2008

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

zbMATH Keywords

processoroptimal schedule

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cited In (3)

• Scheduling on uniform nonsimultaneous parallel machines
• Title not available (Why is that?)
• Scheduling on uniform processors with at most one downtime on each machine

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)