Two-agent scheduling in a flowshop
From MaRDI portal
Publication:322895
DOI10.1016/J.EJOR.2016.01.009zbMATH Open1346.90342OpenAlexW2234892146MaRDI QIDQ322895FDOQ322895
Authors: Baoqiang Fan, T. C. Edwin Cheng 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Competitive two-agent scheduling and its applications
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling Problems with Two Competing Agents
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Multiagent scheduling. Models and algorithms
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Title not available (Why is that?)
- A note on the complexity of the problem of two-agent scheduling on a single machine
- 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
- Two-agent scheduling to minimize the total cost
- A two-machine flowshop problem with two agents
- Scheduling two agents with controllable processing times
Cited In (24)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Two-machine flowshop scheduling in a physical examination center
- A three-agent scheduling problem for minimizing the flow time on two machines
- Approximation schemes for two-machine flow shop scheduling with two agents
- Online single-machine scheduling to minimize the linear combination of makespans of two agents
- Two Heterarchical Multiagent Approaches for FMS Dynamic Scheduling
- Two competitive agents to minimize the weighted total late work and the total completion time
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- Pareto-scheduling of two competing agents with their own equal processing times
- SCHEDULING TWO SALESMEN IN A NETWORK
- An ordered flow shop with two agents
- Two-machine and two-agent flow shop with special processing times structures
- Algorithms for a two‐machine flowshop problem with jobs of two classes
- Two-agent scheduling to minimize the total cost
- A two-machine flowshop problem with two agents
- Two-agent scheduling in a two-machine open shop
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- A two-machine no-wait flow shop problem with two competing agents
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Two-agent single-machine scheduling with release dates to minimize the makespan
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
This page was built for publication: Two-agent scheduling in a flowshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322895)
