Approximation algorithms in batch processing
From MaRDI portal
Publication:1417850
DOI10.1023/A:1027316504440zbMath1053.90033MaRDI QIDQ1417850
Xiaotie Deng, Chung Keung Poon, Yu-Zhong Zhang
Publication date: 6 January 2004
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
Optimal on-line algorithms for one batch machine with grouped processing times, Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead, An improved on-line algorithm for single parallel-batch machine scheduling with delivery times, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs, A two stage scheduling with transportation and batching, Online scheduling on unbounded parallel-batch machines with incompatible job families, Best semi-online algorithms for unbounded parallel batch scheduling, Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan, Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan, A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan, Online batch scheduling on parallel machines with delivery times, Single machine batch scheduling with release times, Scheduling an unbounded batching machine with job processing time compatibilities, On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs, A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times, On-line scheduling with rejection on identical parallel machines, On-line scheduling on a batch machine to minimize makespan with limited restarts, Optimal online-list batch scheduling, Online scheduling on unbounded parallel-batch machines to minimize the makespan, An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan, On-line scheduling with delivery time on a single batch machine, Online scheduling in a parallel batch processing system to minimize makespan using restarts, Scheduling jobs with release dates on parallel batch processing machines, A PTAS for parallel batch scheduling with rejection and dynamic job arrivals, On-line scheduling of unit time jobs with rejection on uniform machines, Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead, On-line scheduling algorithms for a batch machine with finite capacity, Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time, An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times, Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan, THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE, OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
