Kutu Ambalaj Sektörü İçin Müşteri Siparişi Çizelgeleme Problemi: Bir İşletme Uygulaması
Önemli, Büşra Ceyda
Üst veriTüm öğe kaydını göster
Today, companies face increasingly competetitive situations. Every single day, customer needs and expectation levels are rising. Customers wish to buy high quality goods with appropriate prices from suppliers that have satisfactory customer service. To reach these requests that conflict each other, companies have been pushed towards planning and controlling their activities better. Goods which are produced by companies can be of a single type or various types according to customer requests. For companies that have order-based production, accepting close deadlines for orders is important to compete with others. This is the reason why processes related to taking orders, managing orders and producing them according to delivery dates must be managed effectively. While managing customer orders, production capacity, production and inventory systems, and harmony of between them are very important. In this thesis, scheduling of customer orders for a box packaging production company that produces order-based products is taken into consideration. This study aims to create an algorithm to support the decision maker by making efficient schedules. In this algorithm, assigning the orders to days and sequencing the orders during the days have been solved in two stages, and in each stage integer programming models have been used. The model created in the first stage minimizes the weighted tardiness of the orders, and at the same time aims to use the machine capacities efficiently. Here, the weights used in calculating the tardiness are determined by the Analytical Hierarchy Process (AHP) method, based on the knowledge and experience of experts. In the second model, the change in the mold and the destination location of the products produced successively are minimized and the orders of the customers that are distant from the company are given priority. Augmented epsilon constraint method was used to obtain different efficient solutions in alternative priorities. In the real life application carried out in the box packaging production company, the results of the proposed algorithm are compared with the current application results of the factory. The results show that the proposed algorithm has superior performance.
Künye F.M. Julien and M.J Magazine, Scheduling customer orders: an alternative production scheduling approach: Journal of Manufacturing and Operations Management, 3 (1990) 77–199.  A. Güldalı, Seri İş-Akışlı Atölye Çizelgelemesinde Sezgisel Teknikler, Yüksek Lisans Tezi, Gazi Üniversitesi, Fen Bilimleri Enstitüsü, Ankara, 1990.  M. Pinedo, Scheduling Theory, Algorithms and Systems, third edition, Prentice-Hall Newyork, 13-389, 2008.  K. R. Baker and D. Trietsch, Principles of sequencing and scheduling, John Wiley & Sons, New Jersey, 2009.  X. Li, Y.Farouk, A. Lionel, A Multi Objective Meta-heuristic with A Fuzzy Logic Controller for Solving A Scheduling Problem. Computational Intelligence: Foundations and Applications: Proceedings of the 9th International FLINS Conference, Emei, CHINA, 02-04 August 2010.  P. C. Chang and L. H. Su, Scheduling n Jobs on One Machine to Minimize The Maximum Lateness with a Minimum Number of Tardy Jobs, Computers and Industrial Engineering, 40 (2001) 349-360.  C.S. Thomalla, Job shop scheduling with alternative process plans, International Journal of Production Economics, 74 (2001) 125-134.  J. Kunadilok, Heuristics For Scheduling Reentrant Flexible Job Shops With SequenceDependent Setup Times and Limited Buffer Capacities, Ph.D. Thesis, Clemson University, A Dissertation Presented to the Graduate School of Clemson University, USA, 2007.  R. Zhang ve C. Wu, “A Simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective”, Computers & Operations Research, 38 (2011) 854-867.  Y. Donoso, R. Fabregat, JL. Marzo, A Multi-Objective Optimization Scheme for Multicast Routing: A Multitree Approach: Telecommunications Systems Journal. Kluwer Academic Publishers. 27 (2004) 2-4  T. Weise, GPGPU-based Parallel Algorithms for Scheduling Against Due Date <http://www.it-weise.de>, (Erişim tarihi: 16.04.2019).  M. Pinedo, Scheduling Theory, Algorithms and Systems, third edition, Prentice-Hall Newyork, 13-389, 2008.  W. Xia and Z. Wu, An effective hybrid optimization approach for multiobjective flexible job-shop scheduling problems, Computers &Industrial Engineering, 48 (2005) 409–425.  W. Shi-Jin, Z. Bing-Hai and X. Li-Feng, A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem, International Journal of Production Research, 46 (2007) 3027-3058.  L. Xing, Y.Chen and K.Yang, Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling, Applied Soft Computing, 9 (2009) 362-376.  S. Wang and J. Yu, An effective heuristic for flexible job-shop scheduling problem with maintenance activities, Computers and Industrial Engineering, 59 (2010) 436-447.  G. Moslehi and M. Mahnam, A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search, International Journal of Production Economics, 129 (2011) 14-22.  Morton, T. E., Pentico, D. W., Heuristic Scheduling Systems, Wiley, New York, 1993.  Pinedo, M. L., Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood, 1995.  N. Mishra, A. K. Choudhary, and M.K. Tiwari, Modeling the planning and scheduling across the outsourcing supply chain: a Chaos-based fast Tabu-SA approach, International Journal of Production Research, 46 (2007) 3683-3715  J. Gao, L.Sun, and M. Gen, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, Computers and Operations Research, 35 (2008) 2892-2907.  R. Ahmadi, U. Bagchi and T. A. Roemer, Coordinated Scheduling of Customer Orders for Quick Response, Naval Resource Logistics, 52 (2005) 493-512  E. Erel and J. B. Ghosh, Customer order scheduling on a single machine with family setup times: complexity and algorithms, Applied Mathematics and Computation, 185 (2007) 11–18  O. Hazır, Y. Gunalay and E. Erel, Customer order scheduling problem: a comperative metaheuristics study, International Journal of Advanced Manufacturing Technology, 37 (2008) 589-598  S. Hsu and C. H. Liu, Improving delivery efficiency of the customer order scheduling problem in a job shop, Computers and Industrial Engineering, 59 (2009) 856-866  J. Y. T. Leung, H. Li and M. Pinedo, Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time, Annals of Operations Research, 159 (2008) 107-123  H. Tekbaş, Esnek sipariş tipi üretim sistemlerinde müşteri siparişlerinin çizelgelenmesi, Doktora Tezi, İstanbul Teknik Üniversitesi Fen Bilimleri Enstitüsü, İstanbul, 2011.  J. M. Framinan and P.P.- Gonzalez, Order Scheduling with Tardiness Objective: Improved Approximate Solutions European Journal of Operational Research, 266 (2017) 840-850  C. Oğuz, F.S. Salman, Z. B. Yalçın, Order acceptance and scheduling decisions in make-to-order systems, International Journal of Production Economics,125 (2010) 200-211  T.L. Saaty, The Analytic Hierarchy Process, New York: McGraw Hill. International, Translated to Russian, Portuguese, and Chinese, Revised editions, Paperback, Pittsburgh: RWS Publications ,1980  R.T.Marler, J.S. Arora, Survey of multi-objective optimization methods for engineering, Structural and Multidisciplinary Optimization, 6, (2004), 369-395.  G. Mavrotas, Effective implementation of the ε-constraint method in multiobjective mathematical programming problems, Applied Mathematics and Computation, 2, (2009) 455-465.
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir: