Preview

Final project model

Best Essays
Open Document
Open Document
2153 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Final project model
PRODUCTION
MANAGEMENT SYSTEMS
A resource portfolio planning model using
Sampling-based stochastic programming and genetic algorithm

Reconstruct an executable model

GROUP 9
MEMBER:
M10301206 蔣翔宇
M10308803 Phuong
M10301008 王奕翔
M10321814 Bimo Grahito Wicaksono
M10321111 吳家臻
Catalog

Bab I Abstract 5
Bab II Introduction 5
Bab III Problem formation 5
Bab IV Model 7
Bab V Reconstruct 7
Bab VI Method 8
Bab VII Result 11
Bab VIII Conclusion 17
Bab IX References 18

Picture
Figure 1 9
Figure 2 10
Figure 3 10
Figure 4 11
Figure 5 11
Figure 6 12
Figure 7 12
Figure 8 13
Figure 9 13
Figure 10 14
Figure 11 15
Figure 12 15
Figure 13 16
Figure 14 16
Figure 15 17

Table
Table 1 14
Table 2 17
Table 3 17

Bab I Abstract
Resource portfolio planning optimization is crucial to high-tech manufacturing industries. One of the most important characteristics of such a problem is intensive investment and risk in demands. In this study, a nonlinear stochastic optimization model is developed to maximize the expected profit under demand uncertainty. For solution efficiency, a stochastic programming-based genetic algorithm (SPGA) is proposed to determine a profitable capacity planning and task allocation plan. The algorithm improves a conventional two-stage stochastic programming by integrating a genetic algorithm into a stochastic sampling procedure to solve this large-scale nonlinear stochastic optimization on a real-time basis.
Finally, the tradeoff between profits and risks is evaluated under different settings of algorithmic and hedging parameters.
Experimental results have shown that the proposed algorithm can solve the problem efficiently.

Bab II Introduction
Stochastic resource planning and capacity allocation deals with the problem of how to find an optimal resource portfolio under uncertain demands. Such a portfolio planning has been explored in high-tech manufacturing industries due to intensive capital and technology



References: Alonso, A., Escudero, L.F., Ortun˜o, M.T., 2000. Theory and methodology—a stochastic 0–1 program based approach for the air traffic flow management problem. European Journal of Operational Research 120, 47–62. Bard, J.F., Srinivasan, K., Tirupati, D., 1999. An optimization approach to capacity expansion in semiconductor manufacturing facilities. International Journal of Production Research 37 (15), 3359–3382. Barut, M., Sridharan, V., 2004. Production, manufacturing and logistics— design and evaluation of a dynamic capacity apportionment procedure. European Journal of Operational Research 155, 112–133. Chambers, L., 1995Practical Handbook of Genetic Algorithms: Applications, Vol. 1. Chapman & Hall/CRC Press, Boca Raton, FL, pp. 106–113. Chang, T.J., Meade, N., Beasley, J.E., Sharaiha, Y.M., 2000. Heuristic for cardinality constrained portfolio optimization. Computer & Operation Research 27, 1271–1302. Chang, K.H., Chen, H.J., Liu, C.H., 2002. A stochastic programming model for portfolio selection. Journal of the Chinese Institute of Industrial Engineers 19, 31–41. Chen, Z.L., Li, S., Tirupati, D., 2002. A scenario-based stochastic programming approach for technology and capacity planning. Computer & Operations Research 29, 781–806. David, E., 1953. Genetic Algorithm in Search, Optimization and Machine Learning. Addison Wesley Publishing Company, Inc., pp Ehrgott, M., Klamroth, K., Schwehm, C., 2004. Decision aiding an MCDM approach to portfolio optimization. European Journal of Operational Research 155, 752–770. Gen, M., Cheng, R., 2000. Genetic Algorithms and Engineering Optimization. John Wiley & Sons, Inc. Gritsevskyi, A., Nakic´enovic´, N., 2000. Modeling Uncertainty of Induced Technological Change. Policy 20, 907–921. Haupt, R.L., Haupt, S.E., 1998. Practical Genetic Algorithms. John Wiley & Sons, Canada. Higgins, A., David, I., 2005. A simulation model for capacity planning in sugarcane transport. Computer and Electronics in Agriculture 47, 85–102. Higle, J.L., Sen, S., 1996. Stochastic Decomposition. Kluwer Academic Publishers, Dordrecht. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Detroit MI. Hung, Y.F., Leachman, R.C., 1996. A production planning methodology for semiconductor manufacturing based on interactive simulation and linear programming calculations. IEEE Transactions on Semiconductor manufacturing 9 (2), 257–269. Hung, Y.F., Wang, Q.Z., 1997. A new formulation technique for alternative material planning – an approach for semiconductor bin allocation planning. Computer and Industrial Engineering 32 (2), 281–297. Ip, W.H., Li, Y., Man, K.F., Tang, K.S., 2000. Multi-product planning and scheduling using genetic algorithm approach. Computer and Industrial engineering 38, 283–296. Lee, J.H., 2002. Artificial intelligence-based sampling planning system for dynamic manufacturing process. Expert Systems with Application 22, 117–133. Li, Y., Ip, W.H., Wang, W.H., 1998. Genetic algorithm approach to earliness and tardiness production scheduling and planning problem. Computer and Industrial Engineering 54, 65–76. Merkle, D., Middendorf, M., Schmeck, H., 2002. Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation 6 (4), 333–346. Mitsuo, G., Runwei, C., 2000. Genetic Algorithms and Engineering Optimization. A Wiley-Interscience Publication. Neslihan, A., 2002. Notes on the merger strategy of high versus low-tech industries: complementarities and moral hazard. Economics Bulletin 12 (7), 1–12. Papadimitriou, C., 1993. Computational complexity, first ed. Chapter 11: Randomized Computation Spring, ISBN 0-201-53082-1. Pongcharoen, P., Hicks, C., Braiden, P.M., 2004. The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. European Journal of Operational Research 152, 215-225. Rajagopalan, S., 1994. Capacity expansion with alternative technology choices. European Journal of Operational Research, 392–402. Swaminathan, J.M., 2000. Tool capacity planning for semiconductor fabrication facilities under demand uncertainty. European Journal of Operational Research 120, 545–558. Tempo, R., Calafiore, G., Dabbene, F., 2005. Randomized Algorithms for Analysis and Control of Uncertain Systems. Springer-Verlag, London, ISBN 1-85233-524-6. Tiwari, M.K., Vidyarth, N.K., 2000. Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach. International Journal of Production Research 38 (14), 3357–3384. Wang, K.J., Hou, T.C., 2003. Modeling and resolving the joint problem of capacity expansion and allocation with multiple resources and limited budget in semiconductor testing industry.International Journal of Production Research 41 (14), 3217–3235. Wang, K.J., Lin, S.H., 2002. Capacity expansion and allocation for a semiconductor testing facility with a constrained budget. Production Planning and Control 13 (5), 429–437. Wikipedia, 2006. The Free Encyclopedia. <http://en.wikipedia. org/wiki/Genetic_algorithm>. Xia, Y., Liu, B., Wang, S., Lai, K.K., 2000. A model for portfolio selection with order of expected returns. Computers & Operations Research 27, 409–422. Xia, Y., Wang, S., Deng, X., 2001. Theory and methodology: a compromise solution to mutual funds portfolio selection with transaction Costs. European Journal of Operation Research 134, 564–581.

You May Also Find These Documents Helpful

  • Good Essays

    Analysis of the production process utilizes the Theory of Constraint in determining a feasible solution. The first step of Eli Goldratt’s theory has been completed as…

    • 771 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    The optimization model produced a theoretical weekly production schedule that may be used over the 6 month planning horizon.…

    • 504 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    Hi-Ho Yo-Yo, Inc

    • 1077 Words
    • 5 Pages

    When we use the technique of back scheduling, for calculating the period of time of the completion of work, we allocate the resources in reverse order keeping in mind the deadline of the completion of work and come to the date on which we must start the operation, so that the work can be completed within the due date (Wild, 2003).…

    • 1077 Words
    • 5 Pages
    Better Essays
  • Good Essays

    7. Nehring, M., & Topal, E. (2007). Production schedule optimisation in underground hard rock mining using mixed integer programming Project Evaluation Conference 2007, Australasian Institute of Mining and Metallurgy (Vol. 2007, pp. 169-175).…

    • 2161 Words
    • 9 Pages
    Good Essays
  • Powerful Essays

    [8] Companys, R., Mateo, M., "Different Behaviour of a Double Branch-and-Bound Algorithm on Fm|Prmu|Cmax and Fm|Block|Cmax Problems", Computers and Operations Research, Vol. 34, 2007, pp. 938-953. [9] Wang, L., Pan, Q.K., Tasgetiren, M.F., "Minimizing the Total Flow Time in a Flow Shop with Blocking by using Hybrid Harmony Search Algorithms", Expert Systems with Applications, Vol. 37, 2010, pp. 7929-7936. [10] Nawaz, M., Enscore Jr, E.E., Ham, I., "A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem", Omega, Vol. 11, 1983, pp. 91-95. [11] Caraffa, V., Ianes, S., Bagchi, T.P., Sriskandarajah, C., "Minimizing Makespan in a Blocking Flow Shop using Genetic Algorithms", International Journal of Production Economics, Vol. 70, 2001, pp. 101-115. [12] Ribas, I., Companys, R., Tort-Martorell, X., "An Iterated Greedy Algorithm for the Flow Shop Scheduling Problem with Blocking", Omega, Vol. 39, 2011, pp. 293-301. [13] Wang, L., Pan, Q.K., Tasgetiren, M.F., "A Hybrid Harmony Search Algorithm for the Blocking Permutation Flow Shop Scheduling Problem", Computers & Industrial Engineering, Vol. 61, 2011, pp. 76-83. [14] Ruiz, R., & Stutzle, T., "A Simple and Efective Iterated Greedy Algorithm for the Permutation Flow Shop Scheduling Problem", European Journal of Operational Research, Vol. 177, 2007, pp. 2033-2049. [15] Ronconi, D.P., Henriques, L.R.S., "Some Heuristic Algorithms for Total Tardiness Minimization in a Flowshop with Blocking", Omega, Vol. 37, 2009, pp. 272-281. [16] Framinan, J.M., Leisten, R., "An Eficient Constructive Heuristic for Flowtime Minimisation in Permutation Flow Shops", Omega, Vol. 31, 2003, pp. 311-317. [17] Kalczynski, P.J., Kamburowski, J., "An Improved NEH Heuristic to Minimize Makespan in Permutation Flow Shops", Computers and Operations Research, Vol. 35, 2008, pp. 3001-3008. [18] Taillard, E., "Benchmarks for Basic Scheduling Problems", European Journal of Operational Research, Vol. 64, 1993, pp. 278-285.…

    • 6346 Words
    • 26 Pages
    Powerful Essays
  • Powerful Essays

    Thierens, D., 1995, Analysis and design of genetic algorithms, Unpublished doctoral dissertation, Catholic University of Leuven, Leuven…

    • 109935 Words
    • 440 Pages
    Powerful Essays
  • Powerful Essays

    In hierarchical approach, the problem is converted into two sub-problems: Allocation problem and scheduling problem [2]. This separation will reduce complexity; nevertheless, the obtained results are also far from the optimal solutions. In integrated approach, allocation and scheduling are done simultaneously; also, compared to hierarchical method, in this approach better answers will result and also the necessary time for acquiring the solutions is longer. In the following, initially we review on some of the conducted studies with hierarchical approach and then, we will explore the conducted studies with integrated…

    • 1862 Words
    • 8 Pages
    Powerful Essays
  • Better Essays

    Vega

    • 2067 Words
    • 9 Pages

    Many real world problems involve two types of problem difficulty: i) multiple, conflicting objectives and ii) a highly complex search space.On the one hand, instead of a single optimal solution competing goals give rise to a set of compromise solutions, generally denoted as Pareto-optimal. In the absence of preference information, none of the corresponding trade-offs can be said to be better than the others. On the other hand, the search space can be too large and too complex to be solved by exact methods. Thus, efficient optimization strategies are required that are able to deal with both difficulties. Evolutionary algorithms possess several characteristics that are desirable for this kind of problem and make them preferable to classical optimization methods.In fact, various evolutionary approaches to multi-objective optimization have been proposed since 1985, capable of searching for multiple Pareto optimal solutions concurrently in a single simulation run.[8]…

    • 2067 Words
    • 9 Pages
    Better Essays
  • Powerful Essays

    EJOR, 126, 422–435. Tsiakis, P., Shah, N., & Pantelides, C. C. (2001a). Design of multi-echelon supply chain networks under demand uncertainty. Industrial and Engineering Chemistry Research, 40, 3585–3604. Tsiakis, P., Shah, N., & Pantelides, C. C. (2001b). Optimal structures for supply chain networks. In Presented at AIChE annual meeting. Vidal, C. J., & Goetschalckx, M. (1997). Strategic production-distribution models: A critical review with emphasis on global supply chain models. EJOR, 98, 1–18. Wang, B. (2000). Advanced manufacturing in the 21st century. In Proceedings of the 5th annual international conference on industrial engineering—theory, applications and practice. Wenkai, L., Hui, C.-W., Hua, B., & Tong, Z. (2003). Plant-wide scheduling and marginal value analysis for a refinery. In Proceedings of fourth international conference on foundations of computer-aided process operations (pp. 339–342). Wilkinson, S. J., Cortier, A., Shah, N., & Pantelides, C. C. (1996). Integrated production and distribution scheduling on a Europe-wide basis. Computers and Chemical Engineering, S20, S1275–S1280.…

    • 9030 Words
    • 37 Pages
    Powerful Essays
  • Good Essays

    Genetic Algorithms give an intense device to solve optimization issues. With a fitting choice of their operators and parameters they can possibly investigate the whole solution space and achieve the worldwide ideal. The idea of elite selection makes the utilized calculation a flexible instrument for solve constant optimization issues. Here, the set-up of the Genetic Algorithm operators and parameters is tended to, giving system to tune them to enhance execution of condition observing…

    • 901 Words
    • 4 Pages
    Good Essays
  • Good Essays

    IMPReSS, an automated production planning and delivery quotation system of Harris Corporation that uses heuristics as well as optimization-based techniques has increased on-time deliveries from 75% to 95% with no increase in inventories, helped it move from $75 million in losses to $40 million in profits annually, and allowed it to plan its capital investments more efficiently . A system named ‘Coldstart’ uses highly sophisticated implementations of linear and integer programming solvers. With the help of this system, Delta Airlines could solve all the fleet assignment problems and estimated the savings during a period of three months as $220,000 per day over the old schedule. (Source:…

    • 773 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    Just in Time

    • 4213 Words
    • 17 Pages

    Bibliography: Berkley, Blair J. and Ali S.Kiran. (1991) "A simulation study of sequencing rules in a Kanban-controlled flow shop." Decision Sciences, July-August v22 n3 p559(24) Co, Henry C. and Jacobson, Sheldon H. (1994) "The Kanban assignment problem in serial just-in-time production systems." IIE Transactions, March v26 n2 p76(10). GM Brazil 's unique material handling solution. (1992) Industrial Engineering, April v24 n4 p29(1). Muckstadt, John A. and Sridhar R. Tayur. (1995) "Background and structural results. A Comparison of Alternative Kanban Control Mechanisms. IIE Transactions, April v27 n2 p140(11). Samitt, Mark D. and Barry, Al. (1993) "Mixed model operations: solving the manufacturing puzzle." Industrial Engineering, August 1993 v25 n8 p46(4).…

    • 4213 Words
    • 17 Pages
    Powerful Essays
  • Satisfactory Essays

    SVNIT Summer Internship 2014

    • 2691 Words
    • 18 Pages

    machine’s Parameter and Job making methods to increase production and lower planning cost and various…

    • 2691 Words
    • 18 Pages
    Satisfactory Essays
  • Good Essays

    Group Technology

    • 7755 Words
    • 32 Pages

    References: Askin, R.G., Standridge, C.R.: Modeling & Analysis Of Manufacturing Systems, John Wiley & Sons, 1993. B. Kernighan and S. Lin (1970): An Efficient Heuristic Procedure for Partitioning of Electrical Circuits, Bell System Technical Journal, 291-307. Internet sources on Opiz, KK3 und some methods, e.g.: • • • http://www.ielm.ust.hk/dfaculty/ajay/courses/ieem513/GT/GT.html Examples for metaheuristics: T.L. James, E.C. Brown, K.B. Keeling (2007): A hybrid grouping genetic algorithm for the cell formation problem, Computers and Operations Research, Volume 34 (7, July) 2059-2079 . Mahdavi, M.M. Paydar, M. Solimanpur, A. Heidarzade (2009): Genetic algorithm approach for solving a cell formation problem in cellular manufacturing, Expert Systems with Applications: An International Journal, Volume 36 (3, April) 6598-6604. T. Tunnukij, C. Hicks (2009): An Enhanced Grouping Genetic Algorithm for solving the cell formation problem, International Journal of Production Research, Volume 47 (7, Jan.) 1989 – 2007. D. Cao and M. Chen (2004): Using penalty function and Tabu search to solve cell formation problems with fixed cell cost, Computers & Operations Research, Volume 31 (1, Jan.) 21-37. J. Schaller (2005): Tabu search procedures for the cell formation problem with intra-cell transfer costs as a function of cell size, Computers and Industrial Engineering, Volume 49 (3, Nov.), 449 – 462.…

    • 7755 Words
    • 32 Pages
    Good Essays
  • Powerful Essays

    Online Registration

    • 10164 Words
    • 41 Pages

    Springer, Berlin. Kurbel, K., 2008. The Making of Information Systems. Springer. Lamatsch, A., Morlock, M., Neumann, K., Rubach, K., 1988. Schedule – An expert-like system for machine scheduling. Annals of Operations Research 16 (1–4), 425– 438. Lee, J., Lee, K., Park, H., Hong, J., Lee, J., 1997. Developing scheduling systems for daewoo shipbuilding: Das project. European Journal of Operational Research 97 (2), 380–395. Li, H., Li, Z., Li, L., Hu, B., 2000. A production rescheduling expert simulation system. European Journal of Operational Research 124 (2), 283–293. MacCarthy, B.L., Liu, J., 1993. Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling. International Journal of Production Research 31 (1), 59–79. Maturana, F., Gu, P., Naumann, A., Norrie, D.H., 1997. Object-oriented job-shop scheduling using genetic algorithms. Computers in Industry 32 (3), 281–294. McKay, K., Buzacott, J., 2000. Application of computerized production control systems in job shop environments. Computers in Industry 42 (2), 79–97. McKay, K., Wiers, V., 2003. Integrated decision support for planning, scheduling, and dispatching tasks in a focused factory. Computers in Industry 50 (1), 5–14. McKay, K.N., Pinedo, M.L., Webster, S., 2002. Practice-focused research issues for scheduling systems. Production and Operations Management 11 (2), 249–258. McKay, K.N., Safayeni, F.R., Buzacott, J.A., 1988. Job-shop scheduling theory: What is relevant? Interfaces 4 (18), :84–90. McKay, K.N., Safayeni, F.R., Buzacott, J.A., 1995. Common sense realities of planning and scheduling in printed circuit board production. International Journal of Production Research 33 (6), 1587–1603. McKay, K.N., Wiers, V.C.S., 1999. Unifying the theory and practice of production scheduling. Journal of Manufacturing Systems 18 (4), 241–255.…

    • 10164 Words
    • 41 Pages
    Powerful Essays