Flow shop scheduling problem with conflict graphs
type: Item
instance of: scholarly article
title: Flow shop scheduling problem with conflict graphs
zbMATH Open document ID: 1384.90049
author: Nour El Houda Tellache
author: Mourad Boudhar
published in: Annals of Operations Research
publication date: 2018-03-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6852534
zbMATH Keywords: scheduling
zbMATH Keywords: flow-shop
zbMATH Keywords: conflict graph
zbMATH Keywords: complexity
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: s10479-017-2560-x
OpenAlex ID: W2631032937
cites work: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
cites work: Mutual exclusion scheduling
cites work: Scheduling jobs on identical machines with agreement graph
cites work: Scheduling: agreement graph vs resource constraints
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Q3821925
cites work: Q3470246
cites work: Scheduling with incompatible jobs
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Q3267900
cites work: Scheduling with conflicts: Online and offline algorithms
cites work: Mutual exclusion scheduling with interval graphs or related classes. I
cites work: Q4198056
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Solving the path cover problem on circular-arc graphs by using an approximation algorithm
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Reducibility among Combinatorial Problems
cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem
cites work: Permutation vs. non-permutation flow shop schedules
cites work: Some new results in flow shop scheduling
cites work: A note on greedy algorithms for the maximum weighted independent set problem
cites work: Scheduling unit-time tasks in renewable resource constrained flowshops
cites work: Open shop scheduling problems with conflict graphs
DOI: 10.1007/S10479-017-2560-X
description: scientific article; zbMATH DE number 6852534