Scheduling on uniform processors with at most one downtime on each machine

DOI10.1016/J.DISOPT.2014.10.001zbMATH Open1387.90089OpenAlexW2086096974MaRDI QIDQ1751114FDOQ1751114

Authors: Liliana Grigoriu, Donald K. Friesen 

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2014.10.001

Recommendations

• Multiprocessor scheduling with availability constraints
• Scheduling on same-speed processors with at most one downtime on each machine
• Scheduling on uniform nonsimultaneous parallel machines
• Uniform processor scheduling problem with nonsimultaneous available time
• On a special case of uniform processor scheduling

zbMATH Keywords

makespanworst-case boundsmultiprocessor schedulingfixed jobsuniform processorsMULTIFIT

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Bounds on Multiprocessing Timing Anomalies
• Tighter bound for MULTIFIT scheduling on uniform processors
• A note on MULTIFIT scheduling for uniform machines
• Machine scheduling with availability constraints
• Bounds for Multifit Scheduling on Uniform Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• `` Strong NP-Completeness Results
• On the exact upper bound for the Multifit processor scheduling algorithm
• Current trends in deterministic scheduling
• Title not available (Why is that?)
• The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
• The effect of machine availability on the worst-case performance of LPT
• Parallel machines scheduling with machine shutdowns
• Parallel machines scheduling with nonsimultaneous machine available time
• Approximability of scheduling with fixed jobs
• Scheduling on same-speed processors with at most one downtime on each machine
• Uniform machine scheduling with machine available constraints

Cited In (3)

• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Scheduling on same-speed processors with at most one downtime on each machine
• Multiprocessor scheduling with availability constraints

This page was built for publication: Scheduling on uniform processors with at most one downtime on each machine

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