Heuristics for online scheduling on identical parallel machines with two GoS levels

DOI10.1007/s11424-019-7427-6zbMath1420.90018OpenAlexW2966917627MaRDI QIDQ2320626

Shuang Cai, Ke Liu

Publication date: 23 August 2019

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-019-7427-6

zbMATH Keywords

heuristic algorithmparallel machine schedulingonline schedulinggrade of Service (GoS) constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Online algorithms; streaming algorithms (68W27)

Related Items (2)

A quantum computing based numerical method for solving mixed-integer optimal control problems ⋮ Online scheduling on two parallel identical machines under a grade of service provision

Cites Work

• Unnamed Item
• On-line scheduling on parallel machines to minimize the makespan
• Fast approximation algorithms for job scheduling with processing set restrictions
• 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
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• 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
• Parallel machine scheduling with machine availability and eligibility constraints
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Online scheduling on two parallel identical machines under a grade of service provision
• Scheduling parallel machines with inclusive processing set restrictions
• Solving Parallel Machine Scheduling Problems by Column Generation
• Minimizing makespan on parallel machines with release time and machine eligibility restrictions
• Scheduling Parallel Machines On-Line
• An optimal online algorithm for scheduling two machines with release times

This page was built for publication: Heuristics for online scheduling on identical parallel machines with two GoS levels