A note on the complexity of the problem of two-agent scheduling on a single machine
From MaRDI portal
Publication:2385467
DOI10.1007/s10878-006-9001-0zbMath1126.90027OpenAlexW2049449905MaRDI QIDQ2385467
Publication date: 12 October 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9001-0
Production/schedulingCooperative sequencingGames/group decisionsMulti-agent deterministic sequencing
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (66)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Two-agent scheduling in a flowshop ⋮ A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Single machine scheduling with interfering job sets ⋮ A scheduling problem with three competing agents ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-agent scheduling of time-dependent jobs ⋮ A single-machine scheduling problem with two-agent and deteriorating jobs ⋮ Approximation schemes for two-machine flow shop scheduling with two agents ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single machine batch scheduling with two competing agents to minimize total flowtime ⋮ Two-agent scheduling to minimize the total cost ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling two agents on uniform parallel machines with~makespan and cost functions ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ Single-machine scheduling with two competing agents and learning consideration ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ Two-agent single-machine scheduling problems under increasing linear deterioration ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ Scheduling problems with two competing agents to minimize minmax and minsum earliness measures ⋮ A two-machine flowshop problem with two agents ⋮ A Lagrangian approach to single-machine scheduling problems with two competing agents ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ Scheduling interfering job sets on parallel machines ⋮ SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Two-agent scheduling with rejection on a single machine ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs
Cites Work
This page was built for publication: A note on the complexity of the problem of two-agent scheduling on a single machine
