Pages that link to "Item:Q2514124"
From MaRDI portal
The following pages link to Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124):
Displaying 12 items.
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
- Scheduling with time-of-use costs (Q1755384) (← links)
- Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
