Pages that link to "Item:Q1267197"

The following pages link to Semi on-line algorithms for the partition problem (Q1267197):

Displaying 50 items.

• Semi-online scheduling for jobs with release times (Q385494) (← links)
• Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
• Improved semi-online makespan scheduling with a reordering buffer (Q396624) (← links)
• Semi-online scheduling problems on a small number of machines (Q398877) (← links)
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
• Semi-online scheduling revisited (Q442235) (← links)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• Semi-online scheduling on two uniform machines with the known largest size (Q491206) (← links)
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
• Online bin stretching with bunch techniques (Q497684) (← links)
• A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size (Q511074) (← links)
• Online algorithms with advice: the tape model (Q529045) (← links)
• Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
• Semi-online scheduling with known partial information about job sizes on two identical machines (Q551204) (← links)
• Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
• Online scheduling with rearrangement on two related machines (Q627161) (← links)
• Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
• Online scheduling with a buffer on related machines (Q711400) (← links)
• Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
• Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
• Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
• Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
• Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
• Linear time algorithms for parallel machine scheduling (Q856829) (← links)
• Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
• Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
• Optimal semi-online algorithms for machine covering (Q870840) (← links)
• Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
• Online scheduling with reassignment (Q935241) (← links)
• List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
• Machine covering with combined partial information (Q972842) (← links)
• Two semi-online scheduling problems on two uniform machines (Q1006050) (← links)
• Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
• Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
• Semi-online scheduling with machine cost. (Q1433957) (← links)
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times (Q1609082) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Single machine scheduling with job delivery to multiple customers (Q1617286) (← links)
• Online algorithms with advice for the dual bin packing problem (Q1642809) (← links)
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
• A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← links)
• Online bin stretching with three bins (Q1702659) (← links)
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
• Preemptive online algorithms for scheduling with machine cost (Q1777224) (← links)
• Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
• \(\kappa\)-partitioning problems for maximizing the minimum load (Q1879573) (← links)
• A note on on-line scheduling with partial information (Q1886493) (← links)