Pages that link to "Item:Q2434270"

The following pages link to A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270):

Displaying 28 items.

• Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
• Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
• Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
• Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
• Online batch scheduling on parallel machines with delivery times (Q719274) (← links)
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
• Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (Q905848) (← links)
• A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
• Online scheduling with delivery time on a bounded parallel batch machine with limited restart (Q1666180) (← links)
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
• The medical laboratory scheduling for weighted flow-time (Q1740398) (← links)
• Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times (Q1944199) (← links)
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
• Online unbounded batch scheduling on parallel machines with delivery times (Q2354308) (← links)
• Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
• Online scheduling of jobs with kind release times and deadlines on a single machine (Q2422652) (← links)
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
• Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)
• Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead (Q5241278) (← links)
• Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval (Q6053500) (← links)
• Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)