Lot sizing in a no-wait flow shop
type: Item
instance of: scholarly article
title: Lot sizing in a no-wait flow shop
zbMATH Open document ID: 0836.90094
DOI: 10.1016/0167-6377(95)00008-8
author: Hamilton Emmons
author: Kamlesh Mathur
published in: Operations Research Letters
publication date: 1996-01-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 830184
zbMATH Keywords: sequencing
zbMATH Keywords: no-wait flow shop
zbMATH Keywords: traveling salesman
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00008-8
OpenAlex ID: W1979460017
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Q4055377
cites work: Counterexamples to optimal permutation schedules for certain flow shop problems
cites work: The Three-Machine No-Wait Flow Shop is NP-Complete
cites work: Complexity of Scheduling Shops with No Wait in Process
cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
description: scientific article; zbMATH DE number 830184