Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
From MaRDI portal
Publication:862993
DOI10.1007/S11424-006-0101-9zbMATH Open1275.90029OpenAlexW2063081678MaRDI QIDQ862993FDOQ862993
Authors: Shijie Sun, Run-Zi Luo, Wenping Huang 
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
Recommendations
- Semi-on-line scheduling problems for maximizing the minimum machine completion time
- Two semi-online scheduling problems on two uniform machines
- Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
- SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES
- Algorithms for semi-on-line scheduling problems on two uniform machines with set-up time
- Semi on-line scheduling on two identical machines
- Online scheduling of two uniform machines to minimize total completion times
- Semi-online scheduling with known maximum job size on two uniform machines
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
Cites Work
- The exact LPT-bound for maximizing the minimum completion time
- 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 on two identical machines
- Randomized on-line and semi-on-line scheduling on identical machines
- Semi-on-line scheduling problems for maximizing the minimum machine completion time
Cited In (6)
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- Algorithms for semi-on-line scheduling problems on two uniform machines with set-up time
- Semi-online machine covering for two uniform machines
- Semi on-line scheduing problem with the largest processing time of jobs on two uniform machines known
- SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES
- Semi-online scheduling problems on two uniform machines under a grade of service provision
This page was built for publication: Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862993)
