Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
From MaRDI portal
Publication:2508983
DOI10.1016/j.tcs.2006.07.011zbMath1100.68007OpenAlexW1997032351MaRDI QIDQ2508983
Publication date: 20 October 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/646
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (94)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ 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 ⋮ 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 ⋮ 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 ⋮ A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource ⋮ Multitasking scheduling problems with two competitive agents ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ 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 ⋮ 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 ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ 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 ⋮ A lower bound for minimizing the total completion time of a three-agent scheduling problem ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ 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 ⋮ Two-agent scheduling with agent specific batches on an unbounded serial batching machine ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Resource constraint scheduling with a fractional shared resource ⋮ 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 ⋮ Decentralised scheduling with confidentiality protection ⋮ 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 batch scheduling with two competing agents to minimize total flowtime ⋮ Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Two-agent scheduling to minimize the total cost ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ 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 ⋮ Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ 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 ⋮ Minimizing the number of late jobs on a single machine under due date uncertainty ⋮ 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 ⋮ A just-in-time scheduling problem with two competing 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 competitive agents to minimize the weighted total late work and the total completion time ⋮ Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ 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 ⋮ Scheduling two agents with controllable processing times ⋮ 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 ⋮ A Batch Scheduling Problem with Two Agents ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ 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 ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ Shared processor scheduling ⋮ 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 on a bounded series-batch machine to minimize makespan and maximum cost ⋮ Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs ⋮ An Ordered Flow Shop with Two Agents ⋮ 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
- Unnamed Item
- Sequencing games
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- On games corresponding to sequencing situations with ready times
- Approximability of scheduling with fixed jobs
- A multiple-criterion model for machine scheduling
- Scheduling Problems with Two Competing Agents
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
This page was built for publication: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
