Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
type: Item
instance of: scholarly article
title: Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
zbMATH Open document ID: 0920.90076
DOI: 10.1016/S0025-5610(97)00097-X
author: Jack A. A. van der Veen
author: Gerhard J. Woeginger
author: Shuzhong Zhang
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1294693
zbMATH Keywords: asymmetric traveling salesman
zbMATH Keywords: one-machine scheduling
zbMATH Keywords: makespan
zbMATH Keywords: polynomial time solution algorithm
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1294693