Online scheduling of malleable parallel jobs with setup times on two identical machines
From MaRDI portal
Publication:976487
DOI10.1016/J.EJOR.2010.03.005zbMATH Open1188.90097OpenAlexW1997882982MaRDI QIDQ976487FDOQ976487
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
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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Parallel Machines On-Line
- A survey of scheduling problems with setup times or costs
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
- Scheduling on identical machines: How good is LPT in an on-line setting?
- A note on online strip packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
- Improved online algorithms for parallel job scheduling and strip packing
- Minimizing the sum of job completion times on capacitated two-parallel machines
- Competitive online scheduling of perfectly malleable jobs with setup times
- On an on-line scheduling problem for parallel jobs
- On-line scheduling of parallel jobs in a list
- Online scheduling of malleable parallel jobs
- On-line scheduling of parallel jobs on two machines
- Improved algorithm for a generalized on-line scheduling problem on identical machines
Cited In (9)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
- Online scheduling of parallel jobs with preemption on two identical machines
- Online scheduling of malleable parallel jobs
- Improved upper bounds for online malleable job scheduling
- Decentralized Online Scheduling of Malleable NP-hard Jobs
- Online scheduling of moldable parallel tasks
- Online malleable job scheduling for \(m\leq 3\)
- Efficient approximation algorithms for scheduling moldable tasks
- A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs
Uses Software
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)
