Scheduling Problems with Two Competing Agents
From MaRDI portal
Publication:3637420
DOI10.1287/opre.1030.0092zbMath1165.90446OpenAlexW2155047985MaRDI QIDQ3637420
Andrea Pacifici, Pitu B. Mirchandani, Alessandro Agnetis, Dario Pacciarelli
Publication date: 10 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2108/34731
Related Items (only showing first 100 items - show all)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Multitasking scheduling problems with two competitive agents ⋮ A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ A note on the complexity of the problem of two-agent scheduling on a single machine ⋮ Unary NP-hardness of minimizing the number of tardy jobs with deadlines ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ 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 ⋮ Hierarchical optimization on an unbounded parallel-batching machine ⋮ Two-agent scheduling of time-dependent jobs ⋮ 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 ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ 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 ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Two-agent single-machine scheduling with a rate-modifying activity ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes ⋮ An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Hyper-heuristic for integrated due-window scheduling and vehicle routing problem for perishable products considering production quality ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine 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 ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ A multiple-criterion model for machine scheduling with constant deteriorating jobs ⋮ 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 ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ A just-in-time scheduling problem with two competing agents ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ Multi-agent scheduling on a single machine with max-form criteria ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ Multi-agent single machine scheduling ⋮ A market-based multi-agent system model for decentralized multi-project scheduling ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ A Lagrangian approach to single-machine scheduling problems with two competing agents ⋮ Two-agent scheduling on a single machine with release dates ⋮ A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time ⋮ A Batch Scheduling Problem with Two Agents ⋮ A subset-sum type formulation of a two-agent single-machine scheduling problem ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs ⋮ 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 ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Bicriteria scheduling of equal length jobs on uniform parallel machines ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) 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 ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs ⋮ An Ordered Flow Shop with Two Agents ⋮ Two-agent scheduling with rejection on a single machine ⋮ Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times ⋮ Two agent scheduling with a central selection mechanism ⋮ Scheduling two agent task chains with a central selection mechanism ⋮ A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints ⋮ Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness ⋮ Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Single machine scheduling with aging effect and upper-bounded actual processing times ⋮ 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 ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ A note on scheduling problems with competing agents and earliness minimization objectives ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Two-agent scheduling in a flowshop ⋮ Routing and scheduling problems with two agents on a line-shaped network ⋮ Scheduling two job families on a single machine with two competitive agents
This page was built for publication: Scheduling Problems with Two Competing Agents
