Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
From MaRDI portal
Publication:2144217
DOI10.1007/s10288-021-00480-3zbMath1490.90127OpenAlexW3164495234MaRDI QIDQ2144217
Publication date: 1 June 2022
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-021-00480-3
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- A note on unbounded parallel-batch scheduling
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
- Scheduling a batching machine
- Complexities of four problems on two-agent scheduling
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- A note on competing-agent Pareto-scheduling
- Complexities of some problems on multi-agent scheduling on a single machine
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- A survey of due-date related single-machine with two-agent scheduling problem
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- A multiple-criterion model for machine scheduling
- 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
- Multitasking scheduling problems with two competitive agents
- Multiagent Scheduling
