Pages that link to "Item:Q989525"

The following pages link to Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525):

Displaying 47 items.

• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time (Q339589) (← links)
• An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
• A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
• Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
• Two-agent scheduling to minimize the total cost (Q421611) (← links)
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
• A single-machine bi-criterion scheduling problem with two agents (Q482429) (← links)
• A two-machine flowshop problem with two agents (Q709115) (← links)
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
• A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
• A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
• A note on two-agent scheduling with resource dependent release times on a single machine (Q1723365) (← links)
• A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms (Q1723459) (← links)
• Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
• Approximation schemes for two-machine flow shop scheduling with two agents (Q1928514) (← links)
• Approximation schemes for two-agent scheduling on parallel machines (Q1935796) (← links)
• A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
• Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
• 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)
• 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-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)
• Two-agent scheduling on a single machine with release dates (Q2273652) (← links)
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← 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)
• Shared processor scheduling (Q2317136) (← links)
• 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) (← links)
• Scheduling two agents with sum-of-processing-times-based deterioration on a single machine (Q2453274) (← links)
• A batch scheduling problem with two agents (Q2788524) (← 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)
• (Q4782744) (← links)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
• Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
• An Ordered Flow Shop with Two Agents (Q5506757) (← 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)