Speaker: Ceyda O\u011fuz, Ko\u00e7 University<\/p>\n
Date & Time: December 16, 2022, Friday 13:30<\/p>\n
Place: EA-409<\/p>\n
Title: A Matheuristic for the Generalized Order Acceptance and Scheduling Problem<\/p>\n
Abstract: Firms operating on a make-to-order basis may not satisfy the entire demand due to limited capacity and tight delivery times. This necessitates selecting only part of customer orders to maximize the total revenue, which gives rise to the order acceptance and scheduling (OAS) problems. In this study, we investigate a generalized version of the OAS (GOAS) problem originating from a real-life setting. Due to several components of the problem, such as release times, due dates, deadlines and sequence dependent setup times, finding an exact solution to GOAS problem, that determines which orders to accept and how to schedule them simultaneously to maximize the revenue, in reasonable time even in a single machine environment is difficult. Hence, we develop an effective and efficient matheuristic, which consists of a time-bucket based mixed integer linear programming model, a variable neighborhood search algorithm and a tabu search algorithm, for the GOAS problem. Computational results show that the proposed matheuristic outperforms the state-of-the-art algorithms developed for the GOAS problem. The boundary of optimally solved instance size is pushed further and near optimal solutions are obtained in reasonable time for instances falling beyond this boundary. (Joint work with \u0130sten\u00e7 Tarhan.)<\/p>\n
Bio: Ceyda O\u011fuz is Professor of Industrial Engineering in College of Engineering at Ko\u00e7 University, Istanbul, Turkey. Before joining Ko\u00e7 University, she was a faculty member in the School of Business at The Hong Kong Polytechnic University, Hong Kong, from 1993 to 2004. Prof. O\u011fuz conducts research in the areas of logistics and scheduling in manufacturing and computer systems, with an emphasis on sustainability. Her expertise includes algorithm design and system modeling as well as providing optimizing and\/or approximate solutions to the complex systems by means of computational methods. Prof. O\u011fuz has participated in several research projects, which were funded by TUBITAK and jointly by the Hong Kong and the European governments, related to above fields. She has published in refereed journals such as Operations Research, Journal of Scheduling, Computers and Operations Research, and European Journal of Operational Research. Prof. O\u011fuz acts as the associate editor of Journal of Scheduling. She was a keynote speaker on “Computational Biology and Operations Research” at EURO XXV – 25th European Conference on Operational Research in 2012.<\/p>\n","protected":false},"excerpt":{"rendered":"
Speaker: Ceyda O\u011fuz, Ko\u00e7 University Date & Time: December 16, 2022, Friday 13:30 Place: EA-409 Title: A Matheuristic for the Generalized Order Acceptance and Scheduling Problem Abstract: Firms operating on a make-to-order basis may not satisfy the entire demand due to limited capacity and tight delivery times. This necessitates selecting [\u2026] <\/p>\n