Pages that link to "Item:Q2741218"

The following pages link to On-line algorithms for minimizing makespan on batch processing machines (Q2741218):

Displaying 50 items.

• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
• Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
• Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) (← links)
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) (← links)
• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
• Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
• A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
• Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
• Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
• On-line machine scheduling with batch setups (Q604758) (← links)
• Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
• Online batch scheduling on parallel machines with delivery times (Q719274) (← links)
• Single machine batch scheduling with release times (Q732326) (← links)
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine (Q829170) (← links)
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
• On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
• Optimal online-list batch scheduling (Q990939) (← links)
• Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
• On-line scheduling with delivery time on a single batch machine (Q1022586) (← links)
• Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
• On-line integrated production-distribution scheduling problems with capacitated deliveries (Q1042489) (← links)
• Approximation algorithms in batch processing (Q1417850) (← 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)
• 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)
• Algorithms for on-line order batching in an order picking warehouse (Q1761193) (← links)
• On-line scheduling a batch processing system to minimize total weighted job completion time (Q1768601) (← links)
• A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← 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)
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times (Q1944199) (← links)
• Online algorithms to schedule a proportionate flexible flow shop of batching machines (Q2093188) (← links)
• Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)
• Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
• Stochastic scheduling on parallel machines to minimize discounted holding costs (Q2268513) (← 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)
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← 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)
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time (Q2434291) (← links)
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)