A two-machine flowshop problem with two agents
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A dual algorithm for the one-machine scheduling problem
- 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
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- Minimizing total completion time in two-machine flow shops with exact delays
- 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
- On games corresponding to sequencing situations with ready times
- Optimization by simulated annealing
- Scheduling Problems with Two Competing Agents
- Sequencing games
- The Complexity of Flowshop and Jobshop Scheduling
- The two-machine total completion time flow shop problem
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Two-machine flowshop scheduling to minimize mean flow time
Cited in
(24)- Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- An ordered flow shop with two agents
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Two-machine and two-agent flow shop with special processing times structures
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Algorithms for a two‐machine flowshop problem with jobs of two classes
- A two-machine no-wait flow shop problem with two competing agents
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent scheduling in a flowshop
- A single-machine bi-criterion scheduling problem with two agents
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A scheduling problem with three competing agents
- Single machine scheduling with interfering job sets
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- A two-agent single-machine scheduling problem with late work criteria
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance
This page was built for publication: A two-machine flowshop problem with two agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709115)
