Bi-criteria scheduling on a single parallel-batch machine
From MaRDI portal
Publication:437901
DOI10.1016/J.APM.2011.07.084zbMath1243.90061OpenAlexW1965380237MaRDI QIDQ437901
Jinjiang Yuan, Baoqiang Fan, Shi-Sheng Li
Publication date: 20 July 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.07.084
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Bi-objective scheduling on a restricted batching machine ⋮ Unbounded parallel-batch scheduling with drop-line tasks ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Unnamed Item
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- 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
- Complexity results for single-machine problems with positive finish-start time-lags
- Scheduling with batching: A review
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Machine scheduling with an availability constraint
- Multicriteria scheduling
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Single machine parallel batch scheduling subject to precedence constraints
This page was built for publication: Bi-criteria scheduling on a single parallel-batch machine
