Online scheduling on two parallel identical machines under a grade of service provision
From MaRDI portal
Publication:2683376
DOI10.1007/s40305-020-00325-6OpenAlexW3095064423MaRDI QIDQ2683376
Publication date: 10 February 2023
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-020-00325-6
Transportation, logistics and supply chain management (90B06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- On-line scheduling on parallel machines to minimize the makespan
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- A note on hierarchical scheduling on two uniform machines
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling unit length jobs on parallel machines with lookahead information
- 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
- Online scheduling on two uniform machines to minimize the makespan
- Scheduling on identical machines: How good is LPT in an on-line setting?
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Heuristics for online scheduling on identical 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
- Makespan minimization in online scheduling with machine eligibility
- An optimal online algorithm for scheduling two machines with release times
This page was built for publication: Online scheduling on two parallel identical machines under a grade of service provision
