Online scheduling on two parallel identical machines under a grade of service provision

DOI10.1007/S40305-020-00325-6MaRDI QIDQ2683376zbMATH OpenOpenAlexFDO

Authors Shuang Cai, Ke Liu

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

zbMATH Keywords

GoSgrade of service provisiononline schedulingparallel machines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Transportation, logistics and supply chain management (90B06)

Recommendations

• Online and semi-online scheduling of two machines under a grade of service provision
• 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
• Heuristics for online scheduling on identical parallel machines with two GoS levels
• Online scheduling on parallel machines with two goS levels

Cites work

• A note on hierarchical scheduling on two uniform machines
• An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
• An optimal online algorithm for scheduling two machines with release times
• Heuristics for online scheduling on identical parallel machines with two GoS levels
• Makespan minimization in online scheduling with machine eligibility
• On-line scheduling on parallel machines to minimize the makespan
• 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
• Online scheduling on two uniform machines to minimize the makespan
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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 unit length jobs on parallel machines with lookahead information
• Semi-online scheduling problems on two uniform machines under a grade of service provision

Cited in

(5)

• Parallel machine scheduling under a grade of service provision
• Heuristics for online scheduling on identical parallel machines with two GoS levels
• Semi-online scheduling problems on two uniform machines under a grade of service provision
• Semi-online machine covering problem on three hierarchical machines with bounded processing times
• Online and semi-online scheduling of two machines under a grade of service provision

This page was built for publication: Online scheduling on two parallel identical machines under a grade of service provision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2683376)