Semi-online scheduling for jobs with release times

DOI10.1007/s10878-011-9425-zzbMath1282.90074OpenAlexW2129619274MaRDI QIDQ385494

Mohammad Hasan, H. S. Yoon

Publication date: 2 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9425-z

zbMATH Keywords

list schedulingworst-case performanceoptimal algorithmrelease timeon-line scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Semi-online scheduling: a survey ⋮ Prompt mechanism for online auctions with multi-unit demands

Cites Work

• List scheduling for jobs with arbitrary release times and similar lengths
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• On-line scheduling for jobs with arbitrary release times
• Semi-on-line problems on two identical machines with combined partial information
• Semi-online algorithms for parallel machine scheduling problems
• Ordinal algorithms for parallel machine scheduling
• Bounds on Multiprocessing Timing Anomalies
• Semi-online scheduling with decreasing job sizes

This page was built for publication: Semi-online scheduling for jobs with release times