Pages that link to "Item:Q2480197"
From MaRDI portal
The following pages link to Multi-agent single machine scheduling (Q2480197):
Displaying 43 items.
- Routing and scheduling problems with two agents on a line-shaped network (Q2149871) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Tatonnement beyond gross substitutes? Gradient descent to the rescue (Q2206817) (← links)
- Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
- Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
- Two-agent single-machine scheduling with assignable due dates (Q2250186) (← links)
- Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← 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)
- Two-agent scheduling with rejection on a single machine (Q2337544) (← links)
- Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work (Q2359798) (← links)
- Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← 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)
- Multi-agent scheduling on a single machine with max-form criteria (Q2470117) (← links)
- Cooperative scheduling between two single machines (Q2823379) (← links)
- Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures (Q2931176) (← links)
- (Q2951304) (← links)
- SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN (Q3114615) (← links)
- Cooperation in one machine scheduling (Q3142152) (← links)
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine (Q3511376) (← links)
- (Q4736013) (← 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)
- Group Scheduling with Two Competing Agents on a Single Machine (Q5174413) (← 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)
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
- Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents (Q6621844) (← links)
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria (Q6669316) (← links)
