MINIMUM FLOW TIME SCHEDULE GENETIC ALGORITHM FOR MASS CUSTOMIZATION MANUFACTURING USING MINICELLS
暂无分享,去创建一个
[1] David Upton,et al. A Flexible Structure for Computer-Controlled Manufacturing Systems , 1992 .
[2] Randall P. Sadowski,et al. Cellular manufacturing control , 1983 .
[3] Carliss Y. Baldwin,et al. Managing in an age of modularity. , 1997, Harvard business review.
[4] Jose M. Framiñan,et al. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..
[5] Jaideep Motwani,et al. Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 , 1997 .
[6] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Kenji Itoh,et al. Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .
[9] Asoo J. Vakharia,et al. Evaluating Virtual Cells and Multistage Flow Shops: An Analytical Approach , 1999 .
[10] S. Davis. Future Perfect , 1987 .
[11] Hau L. Lee,et al. Mass Customization at Hewlett-Packard : The Power of Postponement , 1999 .
[12] Dale T. Masel,et al. A modular minicell configuration for mass customisation manufacturing , 2007 .
[13] Gürsel A. Süer,et al. Evolutionary programming for minimizing the average flow time in the presence of non-zero ready times , 2003, Comput. Ind. Eng..
[14] Rebecca Duray,et al. Mass customization configurations : an empirical investigation of manufacturing practices of customization , 1997 .
[15] C. Rajendran,et al. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .
[16] Yajie Tian,et al. Three-Stage Tabu Search for Solving Large-Scale Flow Shop Scheduling Problems , 2003 .
[17] S. Kotha. From mass production to mass customization: The case of the National Industrial Bicycle Company of Japan , 1996 .
[18] B. J. Pine,et al. Making mass customization work , 1993 .
[19] Jose M. Framiñan,et al. Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .
[20] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[21] F. T. Piller,et al. Mass customization: four approaches to deliver customized products and services with mass production efficiency , 2002, IEEE International Engineering Management Conference.
[22] Andrew Kusiak,et al. Group technology , 1987 .
[23] Jiyin Liu,et al. Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..
[24] Sanguthevar Rajasekaran,et al. Maximizing reliability while scheduling real-time task-graphs on a cluster of computers , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).
[25] Gilmore Jh,et al. The four faces of mass customization. , 1997 .
[26] Venkata Ranga Neppalli,et al. Minimizing total flow time in a two-machine flowshop problem with minimum makespan , 2001 .
[27] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[28] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[29] Chinyao Low,et al. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..
[30] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[31] John W. Fowler,et al. A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..
[32] Jocelyn Drolet,et al. The cellular manufacturing evolution , 1996 .
[33] Mitsuo Gen,et al. Genetic algorithms and engineering optimization , 1999 .
[34] Chinyao Low,et al. A robust simulated annealing heuristic for flow shop scheduling problems , 2004 .
[35] Michel Gendreau,et al. Metaheuristics in Combinatorial Optimization , 2022 .
[36] Georges Abdul-Nour,et al. Physically reconfigurable virtual cells: a dynamic model for a highly dynamic environment , 1995 .
[37] S. Kotha. Mass Customization: The New Frontier in Business Competition , 1992 .
[38] Ali Allahverdi,et al. New heuristics to minimize total completion time in m-machine flowshops , 2002 .
[39] Wei-Cheng Lai,et al. Design the Hardware of Genetic Algorithm for TSP and MSA , 2004, KES.
[40] Meral Azizoglu,et al. On the minimization of total weighted flow time with identical and uniform parallel machines , 1999, Eur. J. Oper. Res..
[41] D. Fogel. An evolutionary approach to the traveling salesman problem , 1988, Biological Cybernetics.
[42] J. Slomp,et al. Performance comparison of virtual cellular manufacturing with functional and cellular layouts in DRC settings , 2005 .
[43] Christian Blum,et al. Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.
[44] Frank Werner,et al. A heuristic algorithm for minimizing mean flow time with unit setups , 2001, Inf. Process. Lett..
[45] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[46] Charles R. McLean,et al. Flexible Manufacturing System for Mass Customization Manufacturing , 2003, MCPC.
[47] Gürsel A. Süer,et al. Capacitated lot sizing by using multi-chromosome crossover strategy , 2008, J. Intell. Manuf..
[48] N. Anantharaman,et al. Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective , 2004 .
[49] Fathima Fazleena Badurdeen. Minicell Configuration for Mass Customization Manufacturing , 2005 .
[50] R. Barton,et al. Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem , 1997 .
[51] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..
[52] J. Framiñan,et al. An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .
[53] Charles R. McLean,et al. THE VIRTUAL MANUFACTURING CELL , 1982 .
[54] Hoon-Shik Woo,et al. A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..
[55] A. Neubauer. The circular schema theorem for genetic algorithms and two-point crossover , 1997 .