Dear scheduling researcher,

We are delighted to announce the talk given by Ceyda Oğuz (Koç University). The title is "A Matheuristic for the Generalized Order Acceptance and Scheduling Problem".

The seminar will take place on Zoom on Wednesday, February 7 at 14:00 UTC. Join Zoom Meeting https://cesnet.zoom.us/j/95550377545?pwd=NUNRWlhjZHRzZDg5aWRCOTA1S3RzQT09 Meeting ID: 955 5037 7545 Passcode: 003354

You can follow the seminar online or offline on our Youtube channel as well: https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows. 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 İstenç Tarhan.

The next talk in our series will be: Nils Boysen (University of Jena) | February 21 | Scheduling in the e-commerce era: New scheduling problems in order fulfilment and warehousing.

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua