Three-machine open shop with a bottleneck machine revisited
type: Item
instance of: scholarly article
title: Three-machine open shop with a bottleneck machine revisited
zbMATH Open document ID: 1479.90086
author: Inna G. Drobouchevitch
published in: Journal of Scheduling
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7443459
zbMATH Keywords: scheduling
zbMATH Keywords: open shop
zbMATH Keywords: minimum makespan
MaRDI profile type: Publication
full work available at URL: s10951-020-00652-9
OpenAlex ID: W3095608774
cites work: Q3496142
cites work: Q4744042
cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling
cites work: How good is a dense shop schedule?
cites work: Open-shop dense schedules: properties and worst-case performance ratio
cites work: A polynomial algorithm for the three-machine open shop with a bottleneck machine
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Q3995531
cites work: Q3964013
cites work: Makespan minimization in open shops: A polynomial time approximation scheme
cites work: A cyclical search for the two machine flow shop and open shop to minimise finishing time
cites work: Short Shop Schedules
DOI: 10.1007/S10951-020-00652-9
description: scientific article; zbMATH DE number 7443459