Online scheduling of two job types on a set of multipurpose machines with unit processing times
From MaRDI portal
Publication:1761990
Recommendations
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- Online scheduling with unit processing times and processing set restrictions
- Scheduling problems on two sets of identical machines
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Online scheduling of malleable parallel jobs with setup times on two identical machines
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- A Better Algorithm for an Ancient Scheduling Problem
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Bounds for Certain Multiprocessing Anomalies
- Improved Bounds for the Online Scheduling Problem
- Makespan minimization in online scheduling with machine eligibility
- New algorithms for an ancient scheduling problem.
- New lower and upper bounds for on-line scheduling
- On-line load balancing in a hierarchical server topology
- Online and semi-online scheduling of two machines under a grade of service provision
- Online parallel machines scheduling with two hierarchies
- Online scheduling on parallel machines with two goS levels
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Parallel machine scheduling problem with two GoS levels
- Parallel machine scheduling under a grade of service provision
- Parallel machine scheduling with job assignment restrictions
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Semi-matchings for bipartite graphs and load balancing
- Task Scheduling on a Multiprocessor System with Independent Memories
- The Competitiveness of On-Line Assignments
Cited in
(11)- Online scheduling with unit processing times and processing set restrictions
- 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
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
- Makespan minimization in online scheduling with machine eligibility
- Total completion time minimization scheduling on two hierarchical uniform machines
- An asymptotically optimal online algorithm to minimize the total completion time on two 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
- Semi-online scheduling with two GoS levels and unit processing time
- Online scheduling of jobs with favorite machines
- Dynamic scheduling with uncertain job types
This page was built for publication: Online scheduling of two job types on a set of 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 Q1761990)
