Makespan minimization in online scheduling with machine eligibility
From MaRDI portal
(Redirected from Makespan minimization in online scheduling with machine eligibility)
Recommendations
- Makespan minimization in online scheduling with machine eligibility
- Online scheduling with equal processing times and machine eligibility constraints
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Improved bounds for online scheduling with eligibility constraints
- Online scheduling on two uniform machines subject to eligibility constraints
Cites work
- A note on hierarchical scheduling on two uniform machines
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- An optimal online algorithm for scheduling two machines with release times
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Fast approximation algorithms for job scheduling with processing set restrictions
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- On-line load balancing in a hierarchical server topology
- On-line service scheduling
- Online algorithms: a survey
- Online and semi-online scheduling of two machines under a grade of service provision
- Online hierarchical scheduling: an approach using mathematical programming
- Online parallel machines scheduling with two hierarchies
- Online scheduling on parallel machines with two goS levels
- Online scheduling on two uniform machines subject to eligibility constraints
- Online scheduling on two uniform machines to minimize the makespan
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling under a grade of service provision
- Parallel machine scheduling with nested job assignment restrictions
- Parallel machine scheduling with nested processing set restrictions
- Preemptive scheduling on a small number of hierarchical machines
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling on identical machines: How good is LPT in an on-line setting?
- Scheduling Parallel Machines On-Line
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling unit length jobs on parallel machines with lookahead information
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Scheduling with deadlines and loss functions
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- The Competitiveness of On-Line Assignments
- Worst-case analysis for on-line service policies
Cited in
(17)- Surveys in operations research
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- Online scheduling with equal processing times and machine eligibility constraints
- Twelve surveys in operations research
- Online mixed ring covering problem with two nodes
- Online minimum makespan scheduling with a buffer
- scientific article; zbMATH DE number 5670142 (Why is no real title available?)
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- An on-line scheduling problem of parallel machines with common maintenance time
- Makespan minimization in online scheduling with machine eligibility
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Fifty years of research in scheduling -- theory and applications
- Still more surveys in operations research\dots
- Improved bounds for online scheduling with eligibility constraints
- Online makespan minimization with budgeted uncertainty
This page was built for publication: Makespan minimization in online scheduling with machine eligibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894207)
