Online scheduling of malleable parallel jobs with setup times on two identical machines

DOI10.1016/J.EJOR.2010.03.005MaRDI QIDQ976487zbMATH OpenOpenAlexFDO

Authors Shouwei Guo, Liying Kang

Publication date 11 June 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2010.03.005

zbMATH Keywords

competitive analysisschedulingonline algorithmsetup timesparallel jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
• Online scheduling of parallel jobs with bounded processing times on two machines
• Online scheduling of malleable parallel jobs
• Online scheduling of parallel jobs with preemption on two identical machines
• An online scheduling of two type parallel jobs on identical machines
• On-line scheduling of parallel jobs on two machines
• Publication:4489614
• Online scheduling of parallel jobs on two machines is 2-competitive
• Competitive online scheduling of perfectly malleable jobs with setup times
• Online Scheduling of Equal-Length Jobs on Parallel Machines

Cites work

• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• A note on online strip packing
• A survey of scheduling problems with setup times or costs
• An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
• Competitive online scheduling of perfectly malleable jobs with setup times
• Improved algorithm for a generalized on-line scheduling problem on identical machines
• Improved online algorithms for parallel job scheduling and strip packing
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• Minimizing the sum of job completion times on capacitated two-parallel machines
• On an on-line scheduling problem for parallel jobs
• On-line scheduling of parallel jobs in a list
• On-line scheduling of parallel jobs on two machines
• Online scheduling of malleable parallel jobs
• Online scheduling of parallel jobs on two machines is 2-competitive
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Parallel Machines On-Line
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Scheduling parallel jobs to minimize the makespan

Cited in

(12)

• A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs
• Online malleable job scheduling for \(m\leq 3\)
• A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
• Improved upper bounds for online malleable job scheduling
• Efficient approximation algorithms for scheduling moldable tasks
• Online scheduling of parallel jobs with preemption on two identical machines
• Decentralized Online Scheduling of Malleable NP-hard Jobs
• Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
• Online scheduling of two job types on a set of multipurpose machines with unit processing times
• Competitive online scheduling of perfectly malleable jobs with setup times
• Online scheduling of moldable parallel tasks
• Online scheduling of malleable parallel jobs

Describes a project that uses

Uses Software

• NAS Parallel Benchmarks

This page was built for publication: Online scheduling of malleable parallel jobs with setup times on two identical machines

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