ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE

DOI10.17654/DM024020157zbMath1499.90080OpenAlexW3047068485MaRDI QIDQ5076084

Yue Li, Jihuan Ding

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm024020157

zbMATH Keywords

lower boundonline schedulingpreemption-restart

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Online algorithms. The state of the art
• ONLINE SCHEDULING WITH RESTART ON PARALLEL MACHINES
• Scheduling Parallel Machines On-Line
• On-line scheduling on a single machine: Maximizing the number of early jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE