Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

DOI10.1007/S10878-018-0309-3zbMATH Open1400.90166OpenAlexW2803566534WikidataQ129815539 ScholiaQ129815539MaRDI QIDQ721932FDOQ721932

Authors: Xing Chai, Wenhua Li 

Publication date: 20 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0309-3

Recommendations

• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
• On-line scheduling on partial batch parallel machines with chains precedence constraints
• Online scheduling of equal-processing-time task systems
• On-line scheduling with precedence constraints
• Online scheduling of parallel jobs with preemption on two identical machines

zbMATH Keywords

competitive ratiomakespanonline algorithmchain precedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Online scheduling of equal-processing-time task systems
• Optimal scheduling for two-processor systems
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
• Scheduling on identical machines: How good is LPT in an on-line setting?
• An optimal online algorithm for scheduling two machines with release times
• Scheduling three chains on two parallel machines
• Scheduling identical jobs with chain precedence constraints on two uniform machines
• Online Scheduling of Precedence Constrained Tasks
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

Cited In (5)

• On-line scheduling on partial batch parallel machines with chains precedence constraints
• Online Scheduling of Precedence Constrained Tasks
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
• Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
• On-line scheduling with precedence constraints

This page was built for publication: Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

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