Two-machine open shop problem with agreement graph

DOI10.1016/j.tcs.2019.09.005zbMath1435.90073OpenAlexW2972066588MaRDI QIDQ2333794

Mourad Boudhar, Farouk Yalaoui, Nour El Houda Tellache

Publication date: 13 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.005

zbMATH Keywords

complexityschedulingmakespanopen shopagreement graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ New complexity results for shop scheduling problems with agreement graphs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan

Cites Work

• Unnamed Item
• Unnamed Item
• Mutual exclusion scheduling with interval graphs or related classes. I
• Scheduling subject to resource constraints: Classification and complexity
• Mutual exclusion scheduling
• Flow shop scheduling problem with conflict graphs
• Geometric versions of the three-dimensional assignment problem under general norms
• Scheduling jobs on identical machines with agreement graph
• Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
• Open shop scheduling problems with conflict graphs
• Partition into triangles on bounded degree graphs
• New results in two identical machines scheduling with agreement graphs
• Scheduling: agreement graph vs resource constraints
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling

This page was built for publication: Two-machine open shop problem with agreement graph