Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures
暂无分享,去创建一个
[1] George Steiner,et al. Scheduling in Reentrant Robotic Cells: Algorithms and Complexity , 2005, J. Sched..
[2] Ling Wang,et al. A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation , 2014 .
[3] Rubén Ruiz,et al. Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..
[4] Richard J. Linn,et al. Hybrid flow shop scheduling: a survey , 1999 .
[5] Chien-Min Lin,et al. A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem , 2008, Expert Syst. Appl..
[6] Jean-Charles Billaut,et al. Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .
[7] Quan-Ke Pan,et al. A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem , 2014, Appl. Soft Comput..
[8] Lionel Amodeo,et al. New multi-objective method to solve reentrant hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..
[9] Mostafa Zandieh,et al. Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness , 2009 .
[10] Hannu Ahonen,et al. Simulated annealing and tabu search approaches for the Corridor Allocation Problem , 2014, Eur. J. Oper. Res..
[11] Appa Iyer Sivakumar,et al. Job shop scheduling techniques in semiconductor manufacturing , 2006 .
[12] Jen-Shiang Chen,et al. Minimizing makespan in reentrant flow-shops using hybrid tabu search , 2007 .
[13] Manuel Laguna,et al. Tabu Search , 1997 .
[14] Lin Danping,et al. A review of the research methodology for the re-entrant scheduling problem , 2011 .
[15] Hannu Ahonen,et al. Selection and scheduling in a virtual organisation environment with a service broker , 2009, Comput. Ind. Eng..
[16] Rubén Ruiz,et al. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.
[17] Geun-Cheol Lee,et al. Real-time order flowtime estimation methods for two-stage hybrid flowshops , 2014 .
[18] Mostafa Zandieh,et al. Algorithms for a realistic variant of flowshop scheduling , 2010, Comput. Oper. Res..
[19] Martin Middendorf,et al. On scheduling cycle shops: classification, complexity and approximation , 2002 .
[20] Jatinder N. D. Gupta,et al. Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .
[21] Hong Wang,et al. Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions , 2005, Expert Syst. J. Knowl. Eng..
[22] Shigeru Fujimura,et al. Dynamic routing strategies for JIT production in hybrid flow shops , 2012, Comput. Oper. Res..
[23] Mohammad Bagher Fakhrzad,et al. Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach , 2011, Expert Syst. Appl..
[24] Víctor Parada,et al. A client-broker-server architecture of a virtual enterprise for cutting stock applications , 2001, Int. J. Comput. Integr. Manuf..
[25] Rasaratnam Logendran,et al. Bi-criteria group scheduling in hybrid flowshops , 2013 .
[26] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[27] Jose M. Framiñan,et al. Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..
[28] Tsung-Che Chiang,et al. Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms: Review and opportunity , 2013, Comput. Ind. Eng..
[29] Reha Uzsoy,et al. Decomposition methods for reentrant flow shops with sequence‐dependent setup times , 2000 .
[30] Guochun Tang,et al. Minimizing total completion time for re-entrant flow shop scheduling problems , 2011, Theor. Comput. Sci..
[31] Carlos F. Bispo,et al. Managing Simple re-entrant Flow Lines: Theoretical Foundation and Experimental Results , 2001 .
[32] Hyun Joon Shin,et al. A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture , 2007 .
[33] Yeong-Dae Kim,et al. Minimizing makespan on an m-machine re-entrant flowshop , 2008, Comput. Oper. Res..
[34] Paul Xirouchakis,et al. Dispatching Rule-based Algorithms for a Dynamic Flexible Flow Shop Scheduling Problem with Time-dependent Process Defect Rate and Quality Feedback , 2013 .
[35] Ming Liu,et al. A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem , 2013, Comput. Oper. Res..
[36] Antonio Costa,et al. A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem , 2013, Comput. Ind. Eng..
[37] Dong-Ho Lee,et al. Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line , 2011, Expert Syst. Appl..
[38] Heinrich Kuhn,et al. A taxonomy of flexible flow line scheduling procedures , 2007, Eur. J. Oper. Res..
[39] Rubén Ruiz,et al. The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..
[40] Tamás Kis,et al. A review of exact solution methods for the non-preemptive multiprocessor flowshop problem , 2005, Eur. J. Oper. Res..