Pages that link to "Item:Q1417850"
From MaRDI portal
The following pages link to Approximation algorithms in batch processing (Q1417850):
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)
- A two stage scheduling with transportation and batching (Q456105) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← 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)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← 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)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← 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 with rejection on identical parallel machines (Q882532) (← links)
- On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
- Optimal online-list batch scheduling (Q990939) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← 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)
- Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
- On-line scheduling of unit time jobs with rejection on uniform machines (Q1031971) (← links)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← 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)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← 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 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)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← 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)
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← 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)
- Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)