Two-agent scheduling in a flowshop
From MaRDI portal
Publication:322895
DOI10.1016/j.ejor.2016.01.009zbMath1346.90342OpenAlexW2234892146MaRDI QIDQ322895
Cheng, T. C. Edwin, Baoqiang Fan
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.009
Related Items (13)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ 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 ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ 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
Cites Work
- Single machine scheduling with two competing agents and equal job processing times
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent scheduling to minimize the total cost
- A two-machine flowshop problem with two agents
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Structure of a simple scheduling polyhedron
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing 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
- Optimal two- and three-stage production schedules with setup times included
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Multiagent Scheduling
- Unnamed Item
- Unnamed Item
This page was built for publication: Two-agent scheduling in a flowshop
