Online scheduling with unit processing times and processing set restrictions

DOI10.1007/S40305-019-00256-XzbMath1438.90102OpenAlexW2961884489WikidataQ127538960 ScholiaQ127538960MaRDI QIDQ2326081

Yiwei Jiang, Longcheng Liu, Zhiyi Tan, Yong Chen, Guangting Chen, An Zhang

Publication date: 4 October 2019

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-019-00256-x

zbMATH Keywords

competitive ratioonline schedulingprocessing sets

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Online hierarchical scheduling: an approach using mathematical programming
• Improved bounds for online scheduling with eligibility constraints
• Online parallel machines scheduling with two hierarchies
• Online and semi-online scheduling of two machines under a grade of service provision
• Online scheduling of two job types on a set of multipurpose machines with unit processing times
• Parallel machine problems with equal processing times: a survey
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• On-Line Load Balancing in a Hierarchical Server Topology
• The Competitiveness of On-Line Assignments
• Makespan minimization in online scheduling with machine eligibility

This page was built for publication: Online scheduling with unit processing times and processing set restrictions