Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions

Cites Work

Unnamed Item
Total completion time minimization on multiple machines subject to machine availability and makespan constraints
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Two-machine flow shop and open shop scheduling problems with a single maintenance window
Online scheduling on unbounded parallel-batch machines to minimize the makespan
Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Scheduling with batching: A review
Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
A survey of scheduling with parallel batch (p-batch) processing
Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
Single machine scheduling with non-availability interval and optional job rejection
Mixed batch scheduling on identical machines
Online unbounded batch scheduling on parallel machines with delivery times
Single machine unbounded parallel-batch scheduling with forbidden intervals
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
On-line algorithms for minimizing makespan on batch processing machines
Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions