Lot sizing in a no-wait flow shop

Authors:
Hamilton Emmons;Kamlesh Mathur
Affiliations:
Department of Operations Research, Case Western Reserve University, Cleveland, OH 44106, USA;Department of Operations Research, Case Western Reserve University, Cleveland, OH 44106, USA
Venue:
Operations Research Letters
Year:
1995

Citing 1
Cited 3

The Three-Machine No-Wait Flow Shop is NP-Complete

Journal of the ACM (JACM)

An efficient column-generation-based algorithm for solving a pickup-and-delivery problem

Computers and Operations Research
New heuristics for no-wait flowshop scheduling with precedence constraints and sequence dependent setup time

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Multi-product sequencing and lot-sizing under uncertainties: A memetic algorithm

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a no-wait flow shop which manufactures large numbers of copies of a few basic job types. After observing that a no-wait flow shop can be modeled as a traveling salesman problem (TSP), we present some results which can be used to reduce the size of the problem. Further results frequently allow us to quickly generate an optimal sequence for a set of jobs, based on the known solution to a subset or superset of these jobs.