A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems

DOI10.1016/j.ejor.2013.09.017zbMath1305.90196OpenAlexW2133249969MaRDI QIDQ2256205

Jose M. Framinan, Paz Perez-Gonzalez

Publication date: 19 February 2015

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

Full work available at URL: https://idus.us.es/handle/11441/23399

zbMATH Keywords

schedulingmulticriteriainterfering jobsmulti-agent scheduling problemsmulti-customersets of jobs

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (57)

Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem ⋮ Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ 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 ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ 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 ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Two-agent scheduling in a flowshop ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Complexities of four problems on two-agent scheduling ⋮ Competitive project scheduling on two unbounded parallel batch machines ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Decentralized task coordination ⋮ Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Two-agent parallel-machine scheduling with rejection ⋮ Scheduling with competing agents, total late work and job rejection ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Two-agent single-machine scheduling with a rate-modifying activity ⋮ 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 ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ Competitive multi-agent scheduling with an iterative selection rule ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ Two-agent scheduling on a single machine with release dates ⋮ Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ Scheduling to minimize the maximum total completion time per machine ⋮ 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 ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ Two-agent integrated scheduling of production and distribution operations with fixed departure times ⋮ Due date assignment and two-agent scheduling under multitasking environment ⋮ Two-agent scheduling problems with the general position-dependent processing time ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs ⋮ The Service-Oriented Multiagent Approach to High-Performance Scientific Computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Two-agent scheduling to minimize the total cost
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Two-agent single-machine scheduling problems under increasing linear deterioration
• A two-machine flowshop problem with two agents
• Computing the Nash solution for scheduling bargaining problems
• A note on the scheduling with two families of jobs
• Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
• Considering scheduling and preventive maintenance in the flowshop sequencing problem
• Time-dependent scheduling
• Rescheduling problems with deteriorating jobs under disruptions
• Optimal methods for batch processing problem with makespan and maximum lateness objectives
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
• Scheduling two agents with controllable processing times
• Due dates assignment and JIT scheduling with equal-size jobs
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Analyzing scheduling with transient failures
• Innovations in multi-agent systems and application -- 1.
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
• Scheduling interfering job sets on parallel machines
• Rescheduling on a single machine with part-type dependent setup times and deadlines
• Solving a two-agent single-machine scheduling problem considering learning effect
• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• Approximation schemes for two-machine flow shop scheduling with two agents
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• A note on the complexity of the problem of two-agent scheduling on a single machine
• 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
• 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
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
• Competitive Two-Agent Scheduling and Its Applications
• SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN
• A competitive scheduling problem and its relevance to UMTS channel assignment
• RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN
• Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
• Scheduling Problems with Two Competing Agents
• Rescheduling for New Orders
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Production/maintenance cooperative scheduling using multi-agents and fuzzy logic
• Multicriteria Optimization
• Solving multi-agent scheduling problems on parallel machines with a global objective function
• Mixed Criteria Packet Scheduling

This page was built for publication: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems