Pages that link to "Item:Q957356"

The following pages link to An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356):

Displaying 21 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)
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← 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)
• A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
• A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← links)
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
• An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← 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)
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
• Duplicating in batch scheduling (Q2468842) (← links)
• On-line scheduling on partial batch parallel machines with chains precedence constraints (Q2887327) (← links)
• Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines (Q2931174) (← links)