Beam search for sequencing point operations in flat plate manufacturing

Authors:
E. Shayan;L. Al-Hakim
Affiliations:
IRIS, Industrial Engineering Group, Swinburne University of Technology, Hawthorn, Vic. 3122, Australia;The University of Southern Queensland, Toowoomba, QLD 4350, Australia
Venue:
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Year:
2002

Citing 3
Cited 1

A branch and bound algorithm for the job-shop scheduling problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Computers, Chess, and Cognition

Computers, Chess, and Cognition
The harpy speech recognition system.

The harpy speech recognition system.

A beam search implementation for the irregular shape packing problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers point operations problems in which several operations need to be performed at pre-specified locations on a flat plate, by a CNC machine. This paper develops a new procedure based on beam search methodology. The proposed method was tested using real data. The results show that the proposed method provides superior results over the current procedure used by an Australian company. The method significantly reduces the non-value added (travel + changeover) time.