MODELING AND SOLVING THE FLEXIBLE FORGING MODULE SCHEDULING PROBLEM

1 August 1987

journal article
research article
Published by Taylor & Francis in Engineering Optimization

Vol. 12 (1) , 1-12
https://doi.org/10.1080/03052158708941080

Abstract

In this paper, an existing small scale manufacturing system called a Flexible Forging Module (FFM) is considered. For this system the sequence-dependent changeover costs have been identified. In order to obtain an optimal schedule, a network model is developed which easily incorporates both the sequence-dependent changeover costs and the precedence constraints. A branch and bound algorithm is outlined and numerical results are reported.

Keywords

This publication has 5 references indexed in Scilit:

Flexible manufacturing systems: a structural approach
International Journal of Production Research, 1985
A New Formulation for the Travelling Salesman Problem
SIAM Journal on Algebraic Discrete Methods, 1984
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
ACM Transactions on Mathematical Software, 1983
The traveling salesman problem: An update of research
Naval Research Logistics Quarterly, 1983
A restricted Lagrangean approach to the traveling salesman problem
Mathematical Programming, 1981