scientific article; zbMATH DE number 5669942
From MaRDI portal
Publication:3402928
Recommendations
- Semi-on-line multiprocessor scheduling with given total processing time
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- Semi-online multiprocessor scheduling with bounded jobs
- SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES
- Semi-online scheduling on two uniform processors
- Semi-online algorithms for parallel machine scheduling problems
- Lower bounds and semi on-line multiprocessor scheduling
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
Cited in
(9)- Semi-online scheduling problems on a small number of machines
- Algorithms better than LPT for semi-online scheduling with decreasing processing times
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- Semi-on-line multiprocessor scheduling with given total processing time
- scientific article; zbMATH DE number 6469240 (Why is no real title available?)
- Semi-online multiprocessor scheduling with bounded jobs
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
- Improved approximation algorithms for multiprocessor scheduling with testing
- Semi-online scheduling: a survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402928)
