فهرست و منابع پایان نامه مدلسازی و حل مسئله زمانبندی جریان کارگاهی با زمان های تنظیم وابسته به توالی
فهرست:
ندارد.
منبع:
Arnoldoو C. Hax, Dan Candea, 1984. Production and Inventory Management, 2th. New York.
Kenneth R. Baker, 1996. Elements of sequencing and scheduling, 3th. University of Toronto bookstores.
Deepu Philip, 2005. Scheduling Reentrant Flexible Job Shops With Sequence Dependent Setup Times, MS Thesis, Montana State University.
Gupta D., Magnusson T., 2005. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers & Operations Research 32, 727-747.
Paulo M. França, Gupta J.N.D. Alexandre S., Mendes, Pablo Moscato, Klaas J. Veltink, 2005. Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups, Computers & Industrial Engineering 48(3), 491-506.
Schaller E. Gupta J. N. D. Vakharia J., 2000. Scheduling a flowshop manufacturing cell with sequence dependent family setup times, European Journal of Operational Research 125(2), 324-339.
Johnson S.M., 1954. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1, 61–68.
Handbook of Industrial Engineering, 2th Edition., 1992. Salvendy G, editor.Ostwald P.F.
Allahverdi A. Gupta J.N.D. Aldowaisan T., 1999. A review of scheduling research involving setup considerations, OMEGA, International Journal of Management Science 27, 219–239.
Ruiz R. Maroto C., 2004. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research [to appear].
Pinedo M., 1995. Scheduling: Theory, Algorithms, and Systems. 4th. Prentice Hall, NJ.
Eren T. Güner E., 2006. A bicriteria scheduling with sequence-dependent setup times, Applied Mathematics and Computation 179(1), 378-385.
Cheng T.C.E. Gupta J.N.D. Wang G., 2000. A review of flowshop scheduling research with setup times. Production and Operations Management 9, 262–282.
Garey M.R. Johnson D.S. Sethi R., 1976. The complexity of flowshop and job-shop scheduling, Mathematics of Operations Research 1(2), 117–129.
Campbell H.G. Dudek R.A. Smith M.L., 1970. A heuristic algorithm for the n job, m machine sequencing problem. Management Science 16(10), B630–B637.
Nawaz M. Enscore Jr E.E. Ham I., 1983. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA, The International Journal of Management Science 11(1), 91–95.
Osman I.H. Potts C.N., 1989. Simulated annealing for permutation flowshop scheduling. OMEGA, The International Journal of Management Science 17(6), 551–557.
Widmer M. Hertz A., 1989. A new heuristic method for the flowshop sequencing problem. European Journal of Operational Research 41, 186–193.
Reeves C.R., 1995. A genetic algorithm for flowshop sequencing. Computers & Operations Research 22(1), 5–13.
Stafford Jr E.E. Tseng F.T., 1990. On the Srikar–Ghosh MILP model for the N×M SDST flowshop problem. International Journal of Production Research 28(10), 1817–1830.
Ríos-Mercado R.Z. Bard J.F., 1998. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Computers & Operations Research 25(5), 351–366.
Tseng F.T. Stafford Jr E.E., 2001. Two MILP models for the N×M SDST flowshop sequencing problem. International Journal of Production Research 39(8), 1777–1809.
Ríos-Mercado R.Z. Bard J.F., 1999a. A branch-and-bound algorithm for permutation flowshops with sequence-dependent setup times. IIE Transactions 31, 721–731.
Ríos-Mercado R.Z. Bard J.F., 1999b. An enhanced TSP-based heuristic for makespan minimization in a flowshop with setup times. Journal of Heuristics 5, 53–70.
Bryan A., Norman, 1999. Scheduling flowshops with finite buffers and sequence-dependent setup times, Computers & Industrial Engineering 36(1), 163-177.
Ruiz-Torres A.J. Centeno G., 2008. Minimizing the number of late jobs for the permutation flowshop problem with secondary resources. Computers & Operations Research 35, 1227-1249.
Wang X. Cheng T.C., 2007. An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint. Computers & Operations Research 34, 2894-2901.
Schaller J. Gupta J.N.D. Vakharia A.J., 2000. Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research 125, 324–339.
Ruiz, R. Maroto C. Alcaraz J., 2005. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, European Journal of Operational Research 165(1) 34-54.
Ruiz R. Stutzle T., 2008. An iterated greedy heuristic for the sequence dependent setup times flowshop with makespan and weighted tardiness objectives. European Journal of Operational Research 187, 1143-1159.
Ekşioğlu B. Ekşioğlu S.D. Jain P., 2008. A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods. Computers & Industrial Engineering 54, 1-11.
Allahverdi A. Ng C.T. Cheng T.C.E. Kovalyov M.Y., 2008. A survey of scheduling problems with setup times or costs, European Journal of Operational Research 187, 985-1032.
Logendran R. Salmasi N. Sriskandarajah C., 2006. Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, Computers & Operations Research 33(1) 158-180.
Stafford F. Tseng T., 2002. Two models for a family of flowshop sequencing problems, European Journal of Operational Research 142(2), 282-293.
Tang L. Huang L., 2005. Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production, International Journal of Production Economics 105, 357–371.
Gupta S.R. Smith J.S., 2006. Algorithms for single machine total tardiness scheduling with sequence dependent setups. European Journal of Operational Research 175, 722-739.
Parthasarathy S. Rajendran C., 1997. An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs, International Journal of Production Economics 49(3), 255-263.
Gupta N.D., 1975. A search algorithm for the generalized flowshop scheduling problem, Computer and Operation Research 2, 83-90.
Kenneth E. Mcgraw, Maged M. Dessouky, 2001. Sequence dependent batch chemical scheduling with earliness and tardiness penalties. International journal of production research 39(14), 3085-3107.
Merce C. and Fontan G., 2003. MIP-based heuristics for capaciated lotsizing problems, int. J. Production Economic 85, 97-111.
Osman I.H. Kelly J.P., 1996. Meta-heuristics: Theory and Applications. 3th. Kluwer Academic Publishers, Boston.
Das S.R. Canel C., 2005. An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system. International Journal of Production Economics 97, 247-262.
Ho W. Ji P., 2003. Component scheduling for chip shooter machines: a hybrid genetic algorithm approach, Computers and Operations Research 30, 2175–2189.
Ho W. Ji P., 2004. A hybrid genetic algorithm for component sequencing and feeder arrangement. Journal of Intelligent Manufacturing 15, 307–315.
Goldberg D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. 2th. Addison-Wesley, New York.
Gen M. Cheng R., 1997. Genetic Algorithms and Engineering Design. 2th. Wiley, New York.
Laha D. Chakraborty U.K., 2007. An efficient stochastic hybrid heuristic for flowshop scheduling, Engineering Applications of Artificial Intelligence 20, 851–856.
Blum, C., 2005. Ant colony optimization: Introduction and recent trends. Physics of Life Reviews 2, 353–373.
Dorigo, M. Di Caro G. Gambardella L.M., 1999. Ant algorithms for discrete optimization. Artificial Life 5(2), 137–72.
Dorigo M. Stützle T., 2004. Ant Colony optimization. 2th. Cambridge, MA: MIT Press.
Liao C. Juan H., 2007. An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Computers & Operations Research 34, 1899–1909.
Shyua S.J. Linb B.M.T. Yin P.Y., 2004. Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers & Industrial Engineering 47, 181–193.
Rajendran C. Ziegler H., 2004. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155, 426–438.
Birbil S.I. Fang S.C., 2003. An Electromagnetism-like Mechanism for Global Optimization. Journal of Global Optimization 25, 263–282.
Debels D. De Reyck B. Leus R. Vanhoucke M., 2006. A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research 169, 638–653.
Chang PC, Chen SS, Fan CY, In press. A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem, Expert Systems with Applications, doi: 10.1016/j.eswa. 2007.11.050.
Birbil S.I. Feyzioglu O., 2003. A global optimization method for solving fuzzy relation equations. Lecture Notes in Artificial Intelligence 2715, 718-724.
Oda Y., 2002. An asymmetric analog of van der Veen conditions and the traveling salesman problem [II]. European Journal of Operational Research 138, 43-62.
Deıneko V.G. Hoffmann M. Okamoto Y. Woeginger J., 2006. The traveling salesman problem with few inner points. Operations Research Letters 34, 106-110.
Baki M.F., 2006. A new asymmetric pyramidally solvable class of the traveling salesman problem. Operations Research Letters 34, 613-620.
Lawler E. Lenstra J. Rinnooy Kan A. Shmoys D., 1985. The traveling salesman problem: a guided tour of combinatorial optimization. 3th. New York: Wiley.
Lin S. Kernighan B., 1973. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516.
Or I., 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional bloodbanking. Ph.D. Thesis, Evanston, IL: North western University.
Tsubakitani S. Evans J., 1998. Optimizing tabu list size for the traveling salesman problem. Computers and Operations Research 25, 91–97.
Schmitt L. Amini M., 1998. Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: an empirical study. European Journal of Operational Research 108, 551–570.
Righini G. Trubian M., 2004. A note on the approximation of the asymmetric traveling salesman problem. European Journal of Operational Research 153, 255-265.
Mak V. Boland N., 2007. Polyhedral results and exact algorithms for the asymmetric traveling salesman problem with replenishment arcs. Discrete Applied Mathematics 155, 2093 – 2110.
Choi C. Kim S. Kim H., 2003. A genetic algorithm with a mixedregion search for the asymmetric traveling salesman problem. Computers & Operations Research 30, 773–786.