Pages that link to "Item:Q2256205"

The following pages link to A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205):

Displaying 50 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Two-agent scheduling in a flowshop (Q322895) (← links)
• Scheduling two job families on a single machine with two competitive agents (Q326478) (← links)
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
• Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
• Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
• Complexities of four problems on two-agent scheduling (Q1653276) (← links)
• Competitive project scheduling on two unbounded parallel batch machines (Q1656205) (← links)
• Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (Q1706684) (← links)
• Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
• Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
• Two-agent single-machine scheduling with cumulative deterioration (Q2001202) (← links)
• Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants (Q2027040) (← links)
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
• Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
• Two-agent integrated scheduling of production and distribution operations with fixed departure times (Q2076366) (← links)
• Due date assignment and two-agent scheduling under multitasking environment (Q2084604) (← links)
• Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
• Decentralized task coordination (Q2171631) (← links)
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← 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)
• Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← 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)
• Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system (Q2286964) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Two-agent scheduling problems with the general position-dependent processing time (Q2333788) (← 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)
• Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
• Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs (Q5012893) (← links)
• Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem (Q5038175) (← 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)
• The Service-Oriented Multiagent Approach to High-Performance Scientific Computing (Q5274957) (← links)
• Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• Two‐agent scheduling with linear resource‐dependent processing times (Q6072167) (← links)