Pages that link to "Item:Q990962"

The following pages link to Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962):

Displaying 13 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)
• 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)