Abstract
This paper focuses on a typical problem arising in serial production, where two consecutive departments must sequence their internal work, each taking into account the requirements of the other one. Even if the considered problem is inherently multi-objective, to date the only heuristic approaches dealing with this problem use single-objective formulations, and also require specific assumptions on the objective function, leaving the most general case of the problem open for innovative approaches. In this paper, we develop and compare three evolutionary algorithms for dealing with such a type of combinatorial problems. Two algorithms are designed to perform directed search by aggregating the objectives of each department in a single fitness, while a third one is designed to search for the Pareto front of non-dominated solutions. We apply the three algorithms to considerably complex case studies derived from industrial production of furniture. Firstly, we validate the effectiveness of the proposed genetic algorithms considering a simple case study for which information about the optimal solution is available. Then, we focus on more complex case studies, for which no a priori indication on the optimal solutions is available, and perform an extensive comparison of the various approaches. All the considered algorithms are able to find satisfactory solutions on large production sequences with nearly 300 jobs in acceptable computation times, but they also exhibit some complementary characteristics that suggest hybrid combinations of the various methods.
Similar content being viewed by others
References
A. Agnetis P. Detti C. Meloni D. Pacciarelli (2001) ArticleTitleSet-up coordination between two stages of a supply chain Annals of Operations Research 107 15–32 Occurrence Handle10.1023/A:1014934612090
Brizuela, C. A., & Aceves, R. (2003). Experimental genetic operators analysis for the multi-objective permutation flowshop. EMO 2003, Second International Conference on Evolutionary Multi-Criterion Optimization (Lecture Notes in Computer Science, Vol. 2632), Carlos M. Fonseca et al. editors, Springer, pp. 578–592
Chen, J. H., & Ho, S.-Y. (2001). Multi-objective optimization of flexible manufacturing systems, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’2001), Lee Spector et al. editors, Morgan Kaufmann Publishers, San Francisco, California, pp 1260–1267
C. A. Coello Coello (2000) ArticleTitleTreating constraints as objectives for single-objective evolutionary optimization Engineering Optimization 32 IssueID3 275–308
K. Deb A. Pratap S. Agarwal T. Meyarivan (2002) ArticleTitleA fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Transactions on Evolutionary Computation 6 IssueID2 182–197 Occurrence Handle10.1109/4235.996017
C. Dimopoulos A.M.S. Zalzala (2000) ArticleTitleRecent developments in evolutionary computation for manufacturing optimisation: Problems, solutions, and comparisons IEEE Transactions Evolutionary Computation 4 IssueID2 93–113
M. Ehrgott X. Gandibleux (2000) ArticleTitleA survey and annotated bibliography of multiobjective combinatorial optimization OR Spektrum 22 425–460
M. Fletcher R. W. Brennan D. H. Norrie M. Fleetwood (2001) ArticleTitleReconfiguring processes in a holonic sawmill, 2001 IEEE International Conference on Systems, Man, and Cybernetics 1 158–163
D. B. Fogel (1995) Evolutionary computation IEEE Press New York
C. M. Fonseca P. J. Fleming (1998) ArticleTitleMultiobjective optimization and multiple constraint handling with evolutionary algorithms—Part I: A unified formulation IEEE Transactions on Systems, Man and Cybernetics, Part A 28 IssueID1 26–37
Gutin, G., & Punnen, A. P. (Eds.) (2002). Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers
H. Ishibuchi T. Murata (1998) ArticleTitleA multi-objective genetic local search algorithm and its application to flowshop scheduling IEEE Transactions on Systems, Man and Cybernetics, Part C 28 IssueID3 392–403
H. Ishibuchi T. Yoshida T. Murata (2003) ArticleTitleBalance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling IEEE Transactions on Evolutionary Computation 7 IssueID2 204–223 Occurrence Handle10.1109/TEVC.2003.810752
D. F. Jones S. K. Mirrazavi M. Tamiz (2002) ArticleTitleMulti-objective meta-heuristics: An overview of the current state-of-the-art European Journal of Operation Research 137 1–9
S. A. Kazarlis S. E. Papadakis J. B. Theocharis V. Petridis (2001) ArticleTitleMicrogenetic algorithms as generalized hill-climbing operators for GA optimization IEEE Transactions on Evolutionary Computation 5 IssueID3 204–217 Occurrence Handle10.1109/4235.930311
D. B. Kotak M. Fleetwood H. Tamoto W. A. Gruver (2001) ArticleTitleOperational scheduling for rough mills using a virtual manufacturing environment. 2001 IEEE International Conference on Systems, Man, and Cybernetics 1 140–145
Knowles, J., & Corne, D. (1999). The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimization. IEEE CEC 99, Proceedings of the 1999 Congress on Evolutionary Computation, 1, pp 98–105
J. Knowles D. Corne (2000) ArticleTitleApproximating the nondominated front using the pareto archived evolution strategy Evolutionary Computation 8 IssueID2 149–172 Occurrence Handle10.1162/106365600568167
Landa Silva, J. D., & Burke, E. K. (2004). A tutorial on multiobjective metaheuristics for scheduling and timetabling. In X. Gandibleux, M. Sevaux, K. Sorensen & V. T’Kindt (Eds.), Multiple Objective MetaHeuristics. Springer, Lecture Notes in Economics and Mathematical Systems
S. A. Mansouri S. M. Moattar-Husseini S. H. Zegordi (2003) ArticleTitleA genetic algorithm for multiple objective dealing with exceptional elements in cellular manufacturing Production Planning & Control 14 IssueID5 437–446 Occurrence Handle10.1080/09537280310001597334
C. Meloni (2001) ArticleTitleAn evolutionary algorithm for the sequence coordination in furniture production Lecture Notes of Computer Science 2264 91–106
Meloni, C., Naso, D., & Turchiano, B. (2003). Multi-objective genetic algorithms for a class of sequencing problems in manufacturing environments, 2003. IEEE International Conference on Systems, Man & Cybernetics, October 5–8, 2003, Washington, D.C., USA.
Michalewicz, Z. (1995). A survey of constraint handling techniques in evolutionary computation methods. Proceedings of the fourth Annual Conference on Evolutionary Programming, 1995.
Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Berlin; Springer
T. Murata H. Ishibuchi H. Tanaka (1996) ArticleTitleGenetic algorithms for flowshop scheduling problems Computers and Industrial Engineering 30 IssueID4 1061–1071
Naso, D., Surico, M., Turchiano, B., & Kaymak, U. (2005). Genetic algorithms for supply chain scheduling: A case study on ready mixed concrete. Erasmus Research Institute of Management – Report ERS-2004-096-LIS, European Journal of Operation Research, (To appear) 2005.
H. Pierreval M. F. Plaquin (1998) ArticleTitleAn evolutionary approach of multicriteria manufacturing cell formation International Transactions in Operational Research 5 IssueID1 13–25 Occurrence Handle10.1016/S0969-6016(98)00004-5
Younes, A., Ghenniwa, H., & Areibi, S. (2002). An adaptive genetic algorithm for multi objective flexible manufacturing systems. In W. B. Langdon et al. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’2002), Morgan Kaufmann Publishers, San Francisco, California, pp 1241–1248
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Naso, D., Turchiano, B. & Meloni, C. Single and Multi-objective Evolutionary Algorithms for the Coordination of Serial Manufacturing Operations. J Intell Manuf 17, 251–270 (2006). https://doi.org/10.1007/s10845-005-6641-3
Issue Date:
DOI: https://doi.org/10.1007/s10845-005-6641-3