Semi on-line scheduling on two identical machines
From MaRDI portal
Publication:1300219
DOI10.1007/s006070050020zbMath0940.90032OpenAlexW2013144881MaRDI QIDQ1300219
Publication date: 7 September 1999
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s006070050020
Related Items (56)
A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Optimal preemptive semi-online scheduling on two uniform processors ⋮ Semi on-line scheduling on three processors with known sum of the tasks ⋮ A note on on-line scheduling with partial information ⋮ SEMI-ONLINE MACHINE COVERING ⋮ Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Linear time algorithms for parallel machine scheduling ⋮ Semi-online machine covering on two uniform machines with known total size ⋮ Semi-online scheduling with bounded job sizes on two uniform machines ⋮ SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES ⋮ Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines ⋮ Online and semi-online scheduling of two machines under a grade of service provision ⋮ Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing ⋮ Optimal semi-online algorithms for machine covering ⋮ Semi-online scheduling for jobs with release times ⋮ Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on two identical machines with inexact partial information ⋮ Semi-online scheduling problems on a small number of machines ⋮ Bin stretching with migration on two hierarchical machines ⋮ Optimal semi-online algorithm for scheduling with rejection on two uniform machines ⋮ Improved approximation algorithms for multiprocessor scheduling with testing ⋮ Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ The online knapsack problem: advice and randomization ⋮ Semi-online scheduling with machine cost. ⋮ Online scheduling with reassignment ⋮ Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates ⋮ Semi-online scheduling with ``end of sequence information ⋮ Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ List scheduling for jobs with arbitrary release times and similar lengths ⋮ Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines ⋮ Semi-online scheduling on two uniform processors ⋮ Semi-on-line scheduling problems for maximizing the minimum machine completion time ⋮ Semi-online preemptive scheduling: one algorithm for all variants ⋮ An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times ⋮ Machine covering with combined partial information ⋮ Semi-online scheduling with known partial information about job sizes on two identical machines ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Online scheduling with a buffer on related machines ⋮ Semi-on-line scheduling with ordinal data on two uniform machines ⋮ Preemptive online algorithms for scheduling with machine cost ⋮ Several semi-online scheduling problems on two identical machines with combined information ⋮ An optimal semi-online algorithm for 2-machine scheduling with an availability constraint ⋮ Randomized on-line scheduling similar jobs to minimize makespan on two identical processors ⋮ Semi-online scheduling with combined information on two identical machines in parallel ⋮ A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs ⋮ Extension of algorithm list scheduling for a semi-online scheduling problem ⋮ OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES ⋮ Online Order Scheduling Problem with the Same Order Size on Two Identical Machines ⋮ The optimal on-line parallel machine scheduling ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Optimal online algorithms on two hierarchical machines with tightly-grouped processing times ⋮ Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times ⋮ Semi-on-line problems on two identical machines with combined partial information
This page was built for publication: Semi on-line scheduling on two identical machines
