In this paper, we address the two stage assembly flow-shop problem with multiple non-identical assembly machines in stage two to minimise weighted sum of makespan and mean completion time. Also, sequence dependent setup times are considered for the first stage. This problem is a generalisation of previously proposed two stage assembly flow-shop problems (TSAFSP). In many real world industrial and production systems, there is more than one assembly machine to assemble job components. After extending a mathematical mixed-integer linear programming model to solve the problem, we use GAMS software. The TSAFSP has been known as NP-hard. Therefore, our more general problem is NP-hard too and so for large sized problems the right way to proceed is with the use of heuristic algorithms. So in this paper a hybrid VNS heuristic, which is a combination of the variable neighbourhood search (VNS) algorithm and a novel heuristic is developed and its solutions compared with solutions obtained by GAMS. Computational experiments reveal that the hybrid VNS heuristic performs much better than GAMS with respect to the percentage errors and run times.
10 January 2012 in International Journal of Production Research
In classical scheduling problems, it is often assumed that the machines are available during the whole planning horizon, while in realistic environments, machines need to be maintained and therefore may become unavailable within production periods. Hence, in this paper we suggest a joint production and maintenance scheduling (JPMS) with multiple preventive maintenance services, in which the reliability/availability approach is employed to model the maintenance aspects of a problem. To cope with the suggested JPMS, a mixed integer nonlinear programming model is developed and then a population-based variable neighbourhood search (PVNS) algorithm is devised for a solution method. In order to enhance the search diversification of basic variable neighbourhood search (VNS), our PVNS uses an epitome-based mechanism in each iteration to transform a group of initial individuals into a new solution, and then multiple trial solutions are generated in the shaking stage for a given solution. At the end of the local search stage, the best obtained solution by all of the trial solutions is recorded and the worst solution in population is replaced with this new solution. The evolution procedure is continued until a predefined number of iterations is violated. To validate the effectiveness and robustness of PVNS, an extensive computational study is implemented and the simulation results reveal that our PVNS performs better than traditional algorithms, especially in large size problems.
18 February 2010 in The International Journal of Advanced Manufacturing Technology