Semi on-line algorithms for the partition problem
From MaRDI portal
Recommendations
- A semi on-line algorithm for the partition problem
- scientific article; zbMATH DE number 4130003
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Semi-online algorithms for parallel machine scheduling problems
- Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
Cites work
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559404 (Why is no real title available?)
- scientific article; zbMATH DE number 910900 (Why is no real title available?)
- A Better Algorithm for an Ancient Scheduling Problem
- A better lower bound for on-line scheduling
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- New algorithms for an ancient scheduling problem.
- On-line scheduling of parallel jobs
- Ordinal algorithms for parallel machine scheduling
Cited in
(93)- Parallel solutions for preemptive makespan scheduling on two identical machines
- Improved semi-online makespan scheduling with a reordering buffer
- Semi-online scheduling problems on a small number of machines
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Scheduling with testing on multiple identical parallel machines
- Semi-online scheduling with decreasing job sizes
- Semi-online scheduling with ``end of sequence information
- Semi-online preemptive scheduling: one algorithm for all variants
- List scheduling for jobs with arbitrary release times and similar lengths
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- Semi-online scheduling revisited
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- Machine covering with combined partial information
- Semi-on-line multiprocessor scheduling with given total processing time
- Online scheduling on two uniform machines to minimize the makespan
- Semi-online scheduling problems on two identical machines with inexact partial information
- Semi on-line scheduling on three processors with known sum of the tasks
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
- On-line bin-stretching
- Semi-online scheduling with known partial information about job sizes on two identical machines
- Semi-online scheduling with machine cost.
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
- A two-phase algorithm for bin stretching with stretching factor 1.5
- A survey on makespan minimization in semi-online environments
- Online bin stretching with three bins
- Linear time algorithms for parallel machine scheduling
- Several semi-online scheduling problems on two identical machines with combined information
- Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- Online early work maximization on three hierarchical machines with a common due date
- Semi-on-line problems on two identical machines with combined partial information
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
- Improved lower bound on the on-line chain partitioning of semi-orders with representation
- Preemptive online algorithms for scheduling with machine cost
- Online Makespan Scheduling with Job Migration on Uniform Machines
- Semi-on-line scheduling problems for maximizing the minimum machine completion time
- Scheduling In the random-order model
- Online algorithms with advice for the dual bin packing problem
- Single machine scheduling with job delivery to multiple customers
- Semi-on-line scheduling with ordinal data on two uniform machines
- A note on on-line scheduling with partial information
- A semi on-line algorithm for the partition problem
- Online minimum makespan scheduling with a buffer
- Parallel solutions for ordinal scheduling with a small number of machines
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Extension of algorithm list scheduling for a semi-online scheduling problem
- Semi-online scheduling on two uniform processors
- Better Algorithms for Online Bin Stretching
- Optimal semi-online algorithms for machine covering
- Online makespan minimization: the power of restart
- Online scheduling with reassignment
- SEMI-ONLINE MACHINE COVERING
- Online knapsack with removal and recourse
- Bunch technique for semionline with two groups of items
- Online and semi-online scheduling on capacitated two-parallel machines
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- Online scheduling with rearrangement on two related machines
- Optimal algorithms for online scheduling with bounded rearrangement at the end
- Online scheduling with a buffer on related machines
- The online knapsack problem: advice and randomization
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
- Bin stretching with migration on two hierarchical machines
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
- Preemptive semi-online algorithms for parallel machine scheduling with known total size
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- Optimal preemptive semi-online scheduling on two uniform processors
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Discovering and certifying lower bounds for the online bin stretching problem
- Two semi-online scheduling problems on two uniform machines
- Dividing a territory among several vehicles
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- Online makespan scheduling with job migration on uniform machines
- Semi-online scheduling: a survey
- First-Fit Algorithm for the On-Line Chain Partitioning Problem
- Online bin stretching with bunch techniques
- Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
- A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size
- Online and semi-online scheduling of two machines under a grade of service provision
- Semi-online machine covering on two uniform machines with known total size
- Semi-online scheduling for jobs with release times
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines
- Semi-online scheduling on two uniform machines with the known largest size
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- Better algorithms for online bin stretching via computer search
- Dynamic programming optimization in line of sight networks
- Semi-online scheduling with two GoS levels and unit processing time
- Online algorithms with advice: the tape model
This page was built for publication: Semi on-line algorithms for the partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267197)
