Two-machine flowshop scheduling problem with coupled-operations

DOI10.1007/s10479-018-2967-zzbMath1426.90128OpenAlexW2887030022WikidataQ129475786 ScholiaQ129475786MaRDI QIDQ2327688

Mourad Boudhar, Nadjat Meziani, Ammar Oulamara

Publication date: 15 October 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-2967-z

zbMATH Keywords

complexityflowshoppolynomial time algorithmscoupled-operations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Coupled task scheduling with exact delays: literature review and models

Cites Work

• Unnamed Item
• Scheduling of coupled tasks with unit processing times
• Scheduling of coupled tasks and one-machine no-wait robotic cells
• An exact algorithm for scheduling identical coupled tasks
• Approximation algorithms for UET scheduling problems with exact delays
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
• Scheduling coupled tasks
• Shop Problems With Two Machines and Time Lags
• New algorithms for coupled tasks scheduling – a survey
• Algorithms and Computation
• A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
• Approximation Algorithms for Scheduling Problems with Exact Delays
• On the complexity of coupled-task scheduling