Hierarchical optimization on an unbounded parallel-batching machine
From MaRDI portal
Publication:4579881
DOI10.1051/ro/2017089zbMath1457.90068OpenAlexW2774822830MaRDI QIDQ4579881
Publication date: 10 August 2018
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2017089
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
- A note on unbounded parallel-batch scheduling
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Scheduling a batching machine
- A multiple-criterion model for machine scheduling
- Multicriteria scheduling
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Multiagent Scheduling