An on-line scheduling problem of parallel machines with common maintenance time

DOI10.1007/S11424-013-0335-2MaRDI QIDQ394448zbMATH OpenOpenAlexFDO

Authors Qi Feng, Yuhua Cai, Wenjie Li, Weiping Shang

Publication date 27 January 2014

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-013-0335-2

zbMATH Keywords

on-line algorithmnonresumable availabilityparallel machines scheduling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A semi-on-line scheduling problem of two parallel machines with common maintenance time
• On the on-line maintenance scheduling problem
• scientific article; zbMATH DE number 5583893
• The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
• scientific article; zbMATH DE number 1932350

Cites work

• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• scientific article; zbMATH DE number 1094690 (Why is no real title available?)
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• A semi-on-line scheduling problem of two parallel machines with common maintenance time
• Better Bounds for Online Scheduling
• Bounds for Certain Multiprocessing Anomalies
• Improved Bounds for the Online Scheduling Problem
• Machine scheduling with an availability constraint
• Makespan minimization in online scheduling with machine eligibility
• On-line scheduling of parallel jobs with runtime restrictions
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machines scheduling with machine shutdowns
• Parallel machines scheduling with nonsimultaneous machine available time
• The effect of machine availability on the worst-case performance of LPT
• The optimal on-line parallel machine scheduling

Cited in

(3)

• Scheduling a maintenance activity on parallel identical machines
• On the on-line maintenance scheduling problem
• A semi-on-line scheduling problem of two parallel machines with common maintenance time

This page was built for publication: An on-line scheduling problem of parallel machines with common maintenance time

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