The assembly line balancing problem consists of assigning tasks to an ordered sequence of stations such that the precedence relations among the tasks are satis® ed and some performance measure is optimized. Due to the complexity of the problem, heuristic procedures appear to be more promising than the optimum-seeking algorithms. For the single-model, deterministic version, there are numerous exact and heuristic algorithms developed, while for the other more complex but more realistic versions, the research published consists mainly of heuristic procedures. In this paper, the heuristic procedures are critically examined and summarized in su cient detail to provide a state-of-the-art survey. An evaluation of the procedures and some further research topics have also been presented.
I n this paper the machine loading and tool allocation problem of an FMS is discussed. A mathematical model is developed to determine the routings of parts through the machines and to allocate appropriate cutting tools to each machine to achieve minimum overall machining cost Computational experience with this model is presented under various system and operation parameter values. C'otnl~~t;~tionRI rrfinrments haw4 on lagrangean relasation are also disrussrd.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.