On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
type: Item
instance of: scholarly article
title: On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
zbMATH Open document ID: 1154.90492
author: George Steiner
author: Zhihui Xue
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153371
zbMATH Keywords: Job shop
zbMATH Keywords: Reentrant flow shop
zbMATH Keywords: Cycle time
zbMATH Keywords: Makespan
zbMATH Keywords: Algorithms and complexity
MaRDI profile type: Publication
full work available at URL: s10951-006-7041-z
OpenAlex ID: W2126394800
cites work: A heuristic algorithm for two-machine re-entrant shop scheduling
cites work: The complexity of cyclic shop scheduling problems
cites work: Performance Measures and Schedules in Periodic Job Shops
cites work: V-shop scheduling
cites work: Minimizing Makespan in a Class of Reentrant Shops
DOI: 10.1007/S10951-006-7041-Z
description: scientific article; zbMATH DE number 5153371