New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
type: Item
instance of: scholarly article
title: New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
zbMATH Open document ID: 1251.90113
author: Michael Andresen
author: Tanka Nath Dhamala
published in: Annals of Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6107342
zbMATH Keywords: scheduling
zbMATH Keywords: open shop
zbMATH Keywords: comparability graph
zbMATH Keywords: reducibility
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s10479-012-1075-8
OpenAlex ID: W1979873925
cites work: Isomorphism for digraphs and sequences of shop scheduling problems
cites work: On the set of solutions of the open shop problem
cites work: Q4882995
cites work: Q3517651
cites work: Algorithmic graph theory and perfect graphs
cites work: Comparability graphs and a new matroid
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Q4198056
cites work: Modular decomposition and transitive orientation
DOI: 10.1007/S10479-012-1075-8
description: scientific article; zbMATH DE number 6107342