Two-agent scheduling to minimize the total cost

DOI10.1016/J.EJOR.2011.05.041zbMath1237.90094OpenAlexW1984950922MaRDI QIDQ421611

J. Herrera, H. S. Yoon

Publication date: 14 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.05.041

zbMATH Keywords

schedulingapproximation algorithmmulti-agentpolynomial time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (22)

Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Two-agent scheduling in a flowshop ⋮ Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-agent parallel-machine scheduling with rejection ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ Two-agent scheduling on a single machine with release dates ⋮ Two-agent scheduling in a two-machine open shop ⋮ A subset-sum type formulation of a two-agent single-machine scheduling problem ⋮ Scheduling to minimize the maximum total completion time per machine

Cites Work

• Sequencing games
• Structure of a simple scheduling polyhedron
• On games corresponding to sequencing situations with ready times
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A multiple-criterion model for machine scheduling
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents

This page was built for publication: Two-agent scheduling to minimize the total cost