Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
From MaRDI portal
Publication:5865923
DOI10.1142/S0217595921500238zbMath1490.90126OpenAlexW3160324153MaRDI QIDQ5865923
Publication date: 10 June 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921500238
Related Items (1)
Cites Work
- Unnamed Item
- Bi-criteria scheduling on a single parallel-batch machine
- Online over time scheduling on parallel-batch machines: a survey
- A note on unbounded parallel-batch scheduling
- Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
- Optimal methods for batch processing problem with makespan and maximum lateness objectives
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Scheduling a batching machine
- A note on Pareto minimizing total completion time and maximum cost
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- On scheduling an unbounded batch machine
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Scheduling with batching: A review
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Unbounded parallel-batch scheduling with drop-line tasks
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
- Unbounded parallel-batching scheduling with two competitive agents
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Multicriteria scheduling
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Single machine parallel batch scheduling subject to precedence constraints
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
This page was built for publication: Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
