An adaptable problem-space-based search method for flexible flow line scheduling Academic Article

abstract

• Problem-space-based neighborhoods have been recently suggested in the literature for the approximate solution of scheduling problems. This paper explores how effectively these neighborhoods can be adapted to different regular measures of performance in the context of flexible flow line scheduling. Specifically, makespan and mean tardiness are used in the experiments. Near-optimal solutions and significant improvements in the performance of single-pass heuristics are found when searching these spaces with simple local search techniques for industrial and randomly generated problems. 1997 Taylor & Francis Group, LLC.

authors

• Leon, Victor

published proceedings

• IIE TRANSACTIONS

author list (cited authors)

• Leon, V. J., & Ramamoorthy, B.

citation count

• 37

complete list of authors

• Leon, VJ||Ramamoorthy, B

publication date

• February 1997

publisher

• Taylor & Francis  Publisher

published in

• IIE Transactions  Journal

keywords

• 40 Engineering
• 4014 Manufacturing Engineering

Digital Object Identifier (DOI)

• 10.1023/A:1018550624429

start page

• 115

end page

• 125

volume

• 29

issue

• 2

URL

• http%3A%2F%2Fdx.doi.org%2F10.1080%2F07408179708966319