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

DOI10.1016/j.ejor.2010.03.005zbMath1188.90097MaRDI QIDQ976487

Shouwei Guo, Li-ying 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

scheduling; competitive analysis; online algorithm; setup times; parallel jobs

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Online malleable job scheduling for \(m\leq 3\)

Uses Software

• NAS Parallel Benchmarks

Cites Work

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