An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
From MaRDI portal
Publication:1926488
DOI10.1016/J.DISOPT.2012.07.005zbMATH Open1254.90076OpenAlexW2049627958MaRDI QIDQ1926488FDOQ1926488
Authors: Dvir Shabtay, Shlomo Karhi 
Publication date: 28 December 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.07.005
Recommendations
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Online scheduling of two uniform machines to minimize total completion times
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- A class of on-line scheduling algorithms to minimize total completion time
Cites Work
- The Competitiveness of On-Line Assignments
- Scheduling unit length jobs on parallel machines with lookahead information
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Online parallel machines scheduling with two hierarchies
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling on parallel machines with two goS levels
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- Improved bounds for online scheduling with eligibility constraints
Cited In (8)
- Mixed coordination mechanisms for scheduling games on hierarchical machines
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Comments on ``Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- Total completion time minimization scheduling on two hierarchical uniform machines
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
This page was built for publication: An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926488)
