Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree
type: Item
instance of: scholarly article
title: Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree
zbMATH Open document ID: 1464.90026
DOI: 10.1007/978-3-030-10934-9_7
author: Ilya Chernykh
publication date: 2021-05-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7349415
zbMATH Keywords: scheduling
zbMATH Keywords: routing open shop
zbMATH Keywords: preemption
zbMATH Keywords: polynomially solvable subclass
zbMATH Keywords: overloaded node
zbMATH Keywords: overloaded edge
MaRDI profile type: Publication
full work available at URL: 978-3-030-10934-9 7
OpenAlex ID: W2910405850
description: scientific article; zbMATH DE number 7349415