On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
From MaRDI portal
Publication:358659
DOI10.1007/S10878-012-9460-4zbMATH Open1275.90027OpenAlexW2036952194MaRDI QIDQ358659FDOQ358659
Authors: Shlomo Karhi, Dvir Shabtay 
Publication date: 9 August 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9460-4
Recommendations
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- On the optimality of list scheduling for online uniform machines scheduling
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Competitiveness of On-Line Assignments
- Bounds for Certain Multiprocessing Anomalies
- 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
- On-line load balancing in a hierarchical server topology
- Parallel machine scheduling with job assignment restrictions
- Makespan minimization in online scheduling with machine eligibility
- 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
Cited In (9)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Online packing of arbitrary sized items into designated and multipurpose bins
- Total completion time minimization scheduling on two hierarchical uniform machines
- On-line Scheduling with a Monotonous Subsequence Constraint
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
This page was built for publication: On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358659)
