scispace - formally typeset
Journal ArticleDOI

Scheduling algorithms for flexible flow lines

Robert J. Wittrock
- 01 Jul 1985 - 
- Vol. 29, Iss: 4, pp 401-412
TLDR
This paper discusses scheduling algorithms for a certain kind of manufacturing environment, called the “flexible flow line,” and new heuristic algorithms specially suited to solve these problems in the context of a flexible flow line.
Abstract
This paper discusses scheduling algorithms for a certain kind of manufacturing environment, called the “flexible flow line.” Two scheduling problems are considered. “Loading” decides when each part should be loaded into the system. “Mix allocation” selects the daily part mix. The goals are to maximize throughput and reduce WIP. New heuristic algorithms specially suited to solve these problems in the context of a flexible flow line are described. The paper also discusses experience with the use of an experimental implementation of these algorithms to solve such problems arising in a real production line.

read more

Citations
More filters
Journal ArticleDOI

The hybrid flow shop scheduling problem

TL;DR: A literature review on exact, heuristic and metaheuristic methods that have been proposed for the solution of the hybrid flow shop problem is presented.
Journal ArticleDOI

A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

TL;DR: This paper aims to provide a metaheuristic, in the form of a genetic algorithm, to a complex generalized flowshop scheduling problem that results from the addition of unrelated parallel machines at each stage, sequence dependent setup times and machine eligibility.
Journal ArticleDOI

Hybrid flow shop scheduling: a survey

TL;DR: The state of art in hybrid flow shop scheduling is reviewed and suggestions for future research directions are suggested.
Journal ArticleDOI

Sequencing in an assembly line with blocking to minimize cycle time

TL;DR: Heuristic approaches to an assembly line with m stations in series having finite capacity buffers based on an equivalent maximum flow problem and on critical path techniques are proposed.
Journal ArticleDOI

Sequencing of Parts and Robot Moves in a Robotic Cell

TL;DR: In this paper, the problem of sequencing parts and robot moves in a robotic cell where the robot is used to feed machines in the cell is addressed, and the cycle time formulas are developed and analyzed for this purpose for cells producing a single part type using two or three machines.
Related Papers (5)