A two-machine no-wait flow shop problem with two competing agents
From MaRDI portal
Publication:2075466
DOI10.1007/s10878-021-00755-9zbMath1485.90036OpenAlexW3162151920MaRDI QIDQ2075466
Mourad Boudhar, Djamal Rebaine, Abdennour Azerine
Publication date: 14 February 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00755-9
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Unnamed Item
- A two-machine flowshop problem with two agents
- Some no-wait shops scheduling problems: Complexity aspect
- Flowshop scheduling with dominant machines
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- On the exact solution of the no-wait flow shop problem with due date constraints
- A survey of scheduling problems with no-wait in process
- Approximation schemes for two-machine flow shop scheduling with two agents
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Optimal two- and three-stage production schedules with setup times included
- Two-machine flow shop no-wait scheduling with a nonavailability interval
- Some new results in flow shop scheduling
- Scheduling Problems with Two Competing Agents
- Focused Scheduling in Proportionate Flowshops
- Complexity of Scheduling Shops with No Wait in Process
- No-wait flowshops with bicriteria of makespan and total completion time
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Multiagent Scheduling
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Algorithms for a two‐machine flowshop problem with jobs of two classes
