Pages that link to "Item:Q1772971"

The following pages link to A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971):

Displayed 19 items.

• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) ‎ (← links)
• Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) ‎ (← links)
• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) ‎ (← 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)
• Single machine batch scheduling with release times (Q732326) ‎ (← links)
• Optimal online-list batch scheduling (Q990939) ‎ (← links)
• Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) ‎ (← links)
• A best online algorithm for scheduling on two parallel batch machines (Q1019748) ‎ (← links)
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) ‎ (← links)
• Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) ‎ (← links)
• On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) ‎ (← links)
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) ‎ (← links)
• Online scheduling of incompatible unit-length job families with lookahead (Q2250449) ‎ (← links)
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) ‎ (← links)
• Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) ‎ (← links)
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) ‎ (← links)
• An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) ‎ (← links)
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) ‎ (← links)