Page 147 - buku panduan 20192020
P. 147

Faculty of Science Handbook, Session 2019/2020


               Soft Skills:                                    References
               CS3, CTPS3, LL2                                 1.   Markland, R.E & Sweigart, J.R, Quantitative Methods:
                                                                   Applications  to  Managerial  Decision  Making  ,    John
               References                                          Wiley & Sons. 1987
                1 . Hamdy A. Taha. (2011). An introduction to operational   2.   Moore,  L.J,  Lee,  S.M  &  Taylor,  B.W,  Management
                                                                          th
                   research (8 ed.). New York: Mcmillan.           Science, 4  edition, Allyn and Bacon. 1993
                           th
                                                                                                         th
                2.   E. Naddor. (1966). Inventory systems. J. Wiley.    3.   Taha,  H.A,  Operations  Research:  An  Introduction,  5
                3.  Hadley G., & Whitin T.M. (1963). Analysis of inventory   edition,  Macmillan  Pub.  Co.  (edisi  Bahasa  Malaysia
                   systems,  Englewood  Cliggs,  New  Jersey:  Prentice-  oleh USM-DBP). 1992
                   Hall, Inc.                                  4.   Winston, W.L, Operations Research: Applications and
                4.   C.  D.  J.  Waters.  (2003).  Inventory  control  and   Algorithms, Third Edition. Duxbury Press, 2013.
                   management. Canada: University of Calgary..
                5.   Hillier, Frederick S. (2005). Introductory to operations
                            th
                   Rresearch (8  ed.). New York: McGraw-Hill.   SIN3009   INDUSTRIAL OPERATIONAL RESEARCH

                                                               Definition  of  a  network.  Node,  branch,  path,  chain,  cycle
               SIN3007   HEURISTIC METHODS                     and circuit. Examples of network flow model. Network flow:
                                                               Shortest path, minimum spanning tree, maximum flow and
               Introduction. Descent Heuristics: random solutions, greedy   minimum cost maximum flow. Activity Network: Critical path
               solutions,  exchange  heuristics.  Improvement  Heuristics:   model method: Earliest and Latest time, slack activities and
               Local  optimization,  iterated  local  search,  simulated   critical  path.  Project  valuation.  Optimal  path.  Project
               annealing,  tabu  search.  Artificial  Intelligence:  Genetic   scheduling.  Network  model  as  an  example  of  a  linear
               algorithm,  evolutionary  algorithm,  artificial  neural  network.   programming model.
               Evaluating heuristics. NP Completeness.
                                                               Assessment
               Assessment                                      Continuous Assessment:       40%
               Continuous Assessment:       40%                Final Examination:           60%
               Final Examination:           60%
                                                               Medium of Instruction:
               Medium of Instruction:                          Bahasa Malaysia/English
               Bahasa Malaysia/English
                                                               Soft Skills:
               Soft Skills:                                    CS4, CTPS3, LL2, TS2
                CTPS4, LL2
                                                               References
               References                                      1.   Groebner, D.F & Shannon, P.W (1991), Introduction to
               1.   S. S. Skeina, The Algorithm Design, Springer-Verlag,   Management   Science,  International  Edition,  Dallen-
                   1997.                                           Macmillan-Maxwell.
               2.   Ashraf  Aboshosha, Yaser  KhalifaGenetic  Algorithms   2.   Lipin,  L.L  (1994),  Quantitative  Methods  for  Business
                   Theories  and  Applications:  Evolutionary  Algorithms,   Decisions (with cases), 6th edition. Dryden Press.
                   Optimization   Techniques,   Heuristics,   Artificial   3.   Taylor,  B.W  (1993),  Introduction  to  Management
                   Intelligence,  Biologically  inspired  Algorithms,LAP   Science, Allyn and Bacon.
                   LAMBERT Academic Publishing, 2012.          4.    Winston, W.L, Operations Research: Applications and
               3.   Z. Michalewicz, D.B. Fogel, How To Solve It: Modern   Algorithms, Third Edition. Duxbury Press, 2013.
                   Heuristics, Springer-Verlag, 2005.
               4.   I.Osman  and  P.  Kelly,  Met-Heuristics:  Theory  and
                   Applications: Kluwer, 1996.                 SIN3010   COMPUTATIONAL GEOMETRY
               5.   E.  Rich  and  K.  Knight,  Artificial  Intelligence,
                   International Edition, McGraw-Hill Inc., 1991.   Vector algebra, introduction to differential geometry, design
               6.   Z. Michalewicz, Genetic Algorithms + Data Structures   for  curves,  design  surfaces  for  Bezier  surfaces,  triangular
                   = EvolutionProgrammes, Springer-Verlag, 1992.   Bezeir  surfaces,  B-Spline,  rational  Bezier  and  Coons
                                                               surfaces.

               SIN3008   MATHEMATICAL PROGRAMMING              Assessment
                                                               Continuous Assessment:       40%
               The  matrix  of  simplex  theory  and  sensitivity  analysis.   Final Examination:         60%
               Parametric  linear  programming.  Revised  simplex  method.
               The  technique  of  upper  bounded  variables.  Karmarkar’s   Medium of Instruction:
               interior  point  algorithm.  Dantzig-Wolf  decomposition   Bahasa Malaysia/English
               principle.   Pure,   mixed   and   binary   (0-1)   integer
               programming.  Cutting  plane.  Multi-objectives  linear  goal   Soft Skills:
               programming.  Graphical.  Simplex  iterative  and  modified   CTPS3, LL2, CS2, TS2
               methods.                                        References
                                                               1.   Hill,  F.S.  (2014).  Computer  graphics  using  OpenGL,
               Assessment                                          Prentice Hall.
               Continuous Assessment:       40%                2.   Farin,  G.  (1997).  Curves  and surfaces  for computer
               Final Examination:           60%                    aided geometric design. Boston: Academic Press.
                                                               3.   Hoschek,  J.,  &  Lasser,  D.  (1993).  Fundamentals  of
               Medium of Instruction:                              computer aided geometric design. Ak Peters Ltd.
               Bahasa Malaysia/English                         4.   Farin, G., Hoschek, J., & Kim., S.M. (2012). Handbook
                                                                   of   computer   aided   geometric   design.   North
               Soft Skills:                                        Holland: Elsevier.
               CS4, CTPS3, LL2, TS2                            5.   Patrikalakis,  N.  M.,  &  Maekawa,  T.   (2011).  Shape
                                                                   interrogation  for  computer  aided  design  and
                                                                   manufacturing. Springer.


                                                           134
   142   143   144   145   146   147   148   149   150   151   152