Combining Heuristics in Assembly Sequence Planning

Assembly Sequence Planning is tackled by modelling and solving a planning problem that considers the execution of the plan in a system with multiple assembly machines. The objective of the plan is the minimization of the total assembly time (makespan). To meet this objective, the model takes into account the durations and resources for the assembly tasks, the change of configuration in the machines, and the transportation of intermediate subassemblies between different workstations. In order to solve the problem, different heuristics has been defined from two relaxed model of it, one considering only the precedence constraints among tasks, and the other one considering only the use of shared resources. From these basic heuristics, other ones have been defined, combining both types of information from the problem, so that the refinement produces substantial improvements over the initial heuristics.Ministerio de Ciencia y TecnologíaDPI2003-07146-C02-0