Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
暂无分享,去创建一个
[1] Chelliah Sriskandarajah,et al. Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .
[2] Bo Chen. Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .
[3] John E. Biegel,et al. Intelligent Manufacturing-Simulation Agents Tool (IMSAT) , 1993, TOMC.
[4] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[5] Seetuarma L. Narastmhan,et al. Scheduling in a two-stage manufacturing process , 1984 .
[6] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[7] Robert J. Wittrock,et al. An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..
[8] Maged M. Dessouky,et al. Flowshop scheduling with identical jobs and uniform parallel machines , 1998, Eur. J. Oper. Res..
[9] Chung-Yee Lee,et al. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..
[10] Jatinder N. D. Gupta,et al. Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .
[11] J. Hunsucker,et al. BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .
[12] Richard J. Linn,et al. Hybrid flow shop scheduling: a survey , 1999 .
[13] Chris N. Potts,et al. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..
[14] Abdelhakim Artiba,et al. Introduction to Intelligent Simulation: The Rao Language , 1998 .
[15] James R. Wilson,et al. Integrated Variance Reduction Strategies for Simulation , 1996, Oper. Res..
[16] A.H.G. Rinnooy Kan,et al. Single‐machine scheduling subject to stochastic breakdowns , 1990 .
[17] Kenji Itoh,et al. Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .
[18] Wieslaw Kubiak,et al. Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..
[19] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[20] Antony Vignier,et al. A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop , 1996, Proceedings 1996 IEEE Conference on Emerging Technologies and Factory Automation. ETFA '96.
[21] R. A. Dudek,et al. A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .
[22] Scott Turner,et al. Comparison of heuristics for flow shop sequencing , 1987 .
[23] Ali Allahverdi,et al. Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time , 1994 .
[24] Michael A. Langston,et al. Interstage Transportation Planning in the Deterministic Flow-Shop Environment , 1987, Oper. Res..
[25] Michael Pinedo,et al. Current trends in deterministic scheduling , 1997, Ann. Oper. Res..
[26] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[27] Zhi-Long Chen,et al. Scheduling jobs and maintenance activities on parallel machines , 2000 .
[28] Kevin D. Glazebrook,et al. Scheduling stochastic jobs on a single machine subject to breakdowns , 1984 .
[29] Chung-Yee Lee,et al. Machine scheduling with an availability constraint , 1996, J. Glob. Optim..
[30] ČernýV.. Thermodynamical approach to the traveling salesman problem , 1985 .
[31] Zhen Liu,et al. Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates , 1995, Discret. Appl. Math..
[32] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[33] Chung-Yee Lee,et al. Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..
[34] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[35] George L. Vairaktarakis,et al. Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..
[36] Chung-Yee Lee. Two-machine flowshop scheduling with availability constraints , 1999, Eur. J. Oper. Res..
[37] Michael Pinedo,et al. Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..
[38] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[39] Gerhard J. Woeginger,et al. A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem , 2000, Theor. Comput. Sci..
[40] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[41] Jan Karel Lenstra,et al. PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .
[42] Jose M. Framiñan,et al. Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .
[43] Abdelhakim Artiba,et al. A generic production rules-based system for on-line simulation, decision making and discrete process control. , 2005 .
[44] Chandrasekharan Rajendran,et al. Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan , 1992 .
[45] Günter Schmidt,et al. Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..
[46] Abdelhakim Artiba,et al. An architecture of a multi-model system for planning and scheduling , 1997 .
[47] Maged Dessouky,et al. MULTISTAGE HYBRID FLOWSHOP SCHEDULING WITH IDENTICAL JOBS AND UNIFORM PARALLEL MACHINES , 1999 .
[48] Shaukat A. Brah,et al. Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..
[49] Jatinder N. D. Gupta,et al. Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..
[50] Wieslaw Kubiak,et al. Heuristic algorithms for the two-machine flowshop with limited machine availability ☆ , 2001 .