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

DOI10.1016/J.DISOPT.2014.10.001MaRDI QIDQ1751114zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)