机械工程 |
|
|
|
|
柔性Job Shops集成调度启发式算法 |
周炳海, 赵猛 |
同济大学 机械与能源工程学院,上海 201804 |
|
Hybrid heuristic algorithm for integrated scheduling in flexible Job Shops |
ZHOU Bing hai, ZHAO Meng |
School of Mechanical Engineering, Tongji University, Shanghai 201804, China |
[1] HURINK J, KNUST S. Tabu search algorithms for jobshop problems with a single transport robot [J]. European Journal of Operational Research, 2005, 162(1): 99-111.
[2] BRUCKER P, BURKE E K, GROENEMEYER S. A mixed integer programming model for the cyclic jobshop problem with transportation [J]. Discrete Applied Mathematics, 2012, 160(13): 1924-1935.
[3] LEI D, GUO X. Scheduling job shop with lot streaming and transportation through a modified artificial bee colony [J]. International Journal of Production Research, 2013, 51(16): 4930-4941.
[4] CHAUDHRY I A, MAHMOOD S, SHAMI M. Simultaneous scheduling of machines and automated guided vehicles in flexible manufacturing systems using genetic algorithms [J]. Journal of Central South University of Technology, 2011, 18(5): 1473-1486.
[5] LACOMME P, LARABI M, TCHERNEV N. A disjunctive graph for the jobshop with several robot [C] ∥MISTA Conference. Paris: MISTA, 2007: 285-292.
[6] ZHENG Y, XIAO Y, SEO Y. A tabu search algorithm for simultaneous machine/AGV scheduling problem [J]. International Journal of Production Research, 2014,52(19): 5748-5763.
[7] DEROUSSI L, GOURGAND M, TCHERNEV N. A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles [J]. International Journal of Production Research, 2008, 46(8): 2143-2164.
[8] LACOMME P, LARABI M, TCHERNEV N. Jobshop based framework for simultaneous scheduling of machines and automated guided vehicles [J]. International Journal of Production Economics, 2013, 143(1): 24-34.
[9] ZHANG Q, MANIER H, MANIER M A. A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints [J]. International Journal of Production Research, 2014, 52(4): 985-1002.
[10] ZHANG Q, MANIER H, MANIER M A. A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times [J]. Computers and Operations Research, 2012, 39(7): 1713-1723.
[11] LIU Z, MA S, SHI Y, et al. Solving multiobjective flexible Job Shop scheduling with transportation constraints using a micro artificial bee colony algorithm [C] ∥ 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD). Whistler: IEEE, 2013: 427-432.
[12] DRIESSEL R, MNCH L. Variable neighborhood search approaches for scheduling jobs on parallel machines with sequencedependent setup times, precedence constraints, and ready times [J]. Computers and Industrial Engineering, 2011, 61(2): 336-345.
[13] MLADENOVI N, TODOSIJEVI R, UROEVI D. Two level General variable neighborhood search for Attractive traveling salesman problem [J]. Computers and Operations Research, 2014, 52(1): 341-348.
[14] MLADENOVI N, TODOSIJEVI R, UROEVI D. Less is more: Basic variable neighborhood search for minimum differential dispersion problem [J]. Information Sciences, 2016, 326: 160-171.
[15] 严蔚敏, 吴伟民. 数据结构: C 语言版 [M].北京:清华大学出版社有限公司,2002.
[16] BILGE , ULUSOY G. A time window approach to simultaneous scheduling of machines and material handling system in an FMS [J]. Operations Research, 1995, 43(6): 1058-1070. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|