Pages that link to "Item:Q2410095"
From MaRDI portal
The following pages link to Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans (Q2410095):
Displaying 14 items.
- A scheduling problem with three competing agents (Q337134) (← links)
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem (Q1686431) (← links)
- Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
- Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
- Multi-agent scheduling on a single machine with max-form criteria (Q2470117) (← links)
- Multi-agent single machine scheduling (Q2480197) (← links)
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs (Q2508983) (← links)
- (Q2951304) (← links)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria (Q6669316) (← links)
