Single-machine batch scheduling with job processing time compatibility
From MaRDI portal
Publication:2342681
DOI10.1016/J.TCS.2015.03.043zbMath1310.90045OpenAlexW2013523923MaRDI QIDQ2342681
Publication date: 29 April 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.043
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (3)
Construction of Schedules for the Performance of Task Packages in Multi-Stage Systems when Forming Sets of Results and Limitations ⋮ Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs ⋮ An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
Cites Work
- Unnamed Item
- Unnamed Item
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
- Batch machine production with perishability time windows and limited batch size
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Scheduling an unbounded batching machine with job processing time compatibilities
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
- Flowshop scheduling problem with a batching machine and task compatibilities
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Scheduling a batching machine
- Scheduling a batch processing machine with bipartite compatibility graphs
- Complexity results for single-machine problems with positive finish-start time-lags
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- Batch processing with interval graph compatibilities between tasks
- The Batch Loading and Scheduling Problem
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Algorithms for Scheduling Independent Tasks
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Single machine parallel batch scheduling subject to precedence constraints
- Scheduling batches with simultaneous job processing for two-machine shop problems
This page was built for publication: Single-machine batch scheduling with job processing time compatibility
