A two-machine no-wait flow shop problem with two competing agents

DOI10.1007/S10878-021-00755-9MaRDI QIDQ2075466zbMATH OpenOpenAlexFDO

Authors Abdennour Azerine, Mourad Boudhar, Djamal Rebaine

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

zbMATH Keywords

complexityflowshop schedulingmakespanmulti-agentno-wait in process

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A two-machine flowshop problem with two agents
• Two-machine and two-agent flow shop with special processing times structures
• Two-agent scheduling in a flowshop
• Approximation schemes for two-machine flow shop scheduling with two agents
• Scheduling Problems with Two Competing Agents

Cites work

• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A survey of scheduling problems with no-wait in process
• A two-machine flowshop problem with two agents
• Algorithms for a two‐machine flowshop problem with jobs of two classes
• Approximation schemes for two-machine flow shop scheduling with two agents
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Complexity of Scheduling Shops with No Wait in Process
• Flowshop scheduling with dominant machines
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Focused Scheduling in Proportionate Flowshops
• scientific article; zbMATH DE number 4027206 (Why is no real title available?)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
• Multiagent scheduling. Models and algorithms
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• No-wait flowshops with bicriteria of makespan and total completion time
• On the exact solution of the no-wait flow shop problem with due date constraints
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling Problems with Two Competing Agents
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Simple algorithms for gilmore-gomory's traveling salesman and related problems
• Some new results in flow shop scheduling
• Some no-wait shops scheduling problems: Complexity aspect
• Two-machine flow shop no-wait scheduling with a nonavailability interval

Cited in

(8)

• Approximation schemes for two-machine flow shop scheduling 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
• An ordered flow shop with two agents
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
• On the complexity of proportionate open shop and job shop problems
• Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents
• A two-machine flowshop problem with two agents

This page was built for publication: A two-machine no-wait flow shop problem with two competing agents

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