Pages that link to "Item:Q2470117"
From MaRDI portal
The following pages link to Multi-agent scheduling on a single machine with max-form criteria (Q2470117):
Displayed 26 items.
- A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120) (← 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)
- Two-agent scheduling with rejection on a single machine (Q2337544) (← links)
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Two-agent scheduling of time-dependent jobs (Q2410089) (← links)
- A note on a two-agent scheduling problem related to the total weighted late work (Q2424661) (← links)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine (Q2453274) (← links)
- Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures (Q2931176) (← links)
- SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine (Q3511376) (← links)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
- Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
- Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration (Q5174416) (← links)
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
- Single Machine Two-Agent Scheduling with Deteriorating Jobs (Q5506754) (← links)
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
- Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
