Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines

DOI10.1007/S11424-006-0101-9zbMath1275.90029OpenAlexW2063081678MaRDI QIDQ862993

Shijie Sun, Wen Ping Huang, Run-Zi Luo

Publication date: 25 January 2007

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

Full work available at URL: https://doi.org/10.1007/s11424-006-0101-9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Semi-online machine covering for two uniform machines

Cites Work

• Unnamed Item
• The exact LPT-bound for maximizing the minimum completion time
• Semi on-line scheduling on two identical machines
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Semi-on-line scheduling problems for maximizing the minimum machine completion time

This page was built for publication: Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines