On the complexity of bi-criteria scheduling on a single batch processing machine
From MaRDI portal
Publication:633556
DOI10.1007/s10951-010-0180-2zbMath1208.90073OpenAlexW2034359812MaRDI QIDQ633556
Publication date: 1 April 2011
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0180-2
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)
Related Items
Mixed batch scheduling on identical machines ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Bi-criteria scheduling on a single parallel-batch machine ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Unnamed Item
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Multiple and bicriteria scheduling: A literature survey
- Scheduling a batching machine
- Complexity of single machine, multi-criteria scheduling problems
- On scheduling an unbounded batch machine
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Minimizing total completion time on a batch processing machine with job families
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling batch processing machines with incompatible job families
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
