A scheduling problem with three competing agents

DOI10.1016/J.COR.2014.06.011MaRDI QIDQ337134zbMATHOpenAlexFDO

Authors Wen-Chiung Lee, Jen-Ya Wang

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2014.06.011

zbMATH Keywords

schedulingmakespansingle-machinetotal weighted completion timemaintenance activitymultiple-agent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A lower bound for minimizing the total completion time of a three-agent scheduling problem
• A three-agent scheduling problem for minimizing the flow time on two machines
• 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
• Multi-agent single machine scheduling
• Solving a two-agent single-machine scheduling problem considering learning effect

Cites work

• A Lagrangian approach to single-machine scheduling problems with two competing agents
• A multiple-criterion model for machine scheduling
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A note on the scheduling with two families of jobs
• A single-machine scheduling problem with two-agent and deteriorating jobs
• A two-machine flowshop problem with two agents
• Competitive two-agent scheduling and its applications
• Introduction to algorithms
• Machine scheduling with an availability constraint
• Minimizing Weighted Completion Times with Deadlines
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties
• Planning Machine Maintenance in Two-Machine Shop Scheduling
• Scheduling Problems with Two Competing Agents
• Scheduling on semi-identical processors
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Single-machine scheduling with two competing agents and learning consideration
• Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities

Cited in

(5)

• Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
• scientific article; zbMATH DE number 1323827 (Why is no real title available?)
• A three-agent scheduling problem for minimizing the flow time on two machines
• A lower bound for minimizing the total completion time of a three-agent scheduling problem
• Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities

This page was built for publication: A scheduling problem with three competing agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337134)