Minimizing makespan in batch machine scheduling
From MaRDI portal
Publication:1882631
DOI10.1007/s00453-004-1083-4zbMath1069.90044OpenAlexW1966508610MaRDI QIDQ1882631
Pixing Zhang, Chung Keung Poon
Publication date: 1 October 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1083-4
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (16)
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan ⋮ An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan ⋮ Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Best semi-online algorithms for unbounded parallel batch scheduling ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan ⋮ On-line scheduling algorithms for a batch machine with finite capacity ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ A PTAS for parallel batch scheduling with rejection and dynamic job arrivals ⋮ Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
This page was built for publication: Minimizing makespan in batch machine scheduling
