An adaptive branch and bound approach for transforming job shops into flow shops

Authors:
Jose M. Framinan
Affiliations:
Industrial Management, School of Engineering, University of Seville, Ave. Descubrimientos s/n, E41092 Seville, Spain
Venue:
Computers and Industrial Engineering
Year:
2007

Citing 4
Cited 1

Kanban, MRP and shaping the manufacturing environment

Management Science
New search spaces for sequencing problems with application to job shop scheduling

Management Science
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

SIAM Journal on Computing
An ACO algorithm for the shortest common supersequence problem

New ideas in optimization

Reliability evaluation for a manufacturing network with multiple production lines

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address the problem of transforming a job shop layout into a flow shop with the objective of minimizing the length of the resulting flow-line. First, we present five properties of the problem under consideration that are employed for constructing a branch and bound algorithm. The approach is named adaptive since the development of the children nodes depends on the particular instance in order to try tightening the lower bounds and hence performing faster. The computational experiments carried out show the approach to be effective for a variety of problem sizes.