Due date quotation in make-to-order systems with lead time sensitive customers
||The system is temporarily closed to updates for reporting purpose.
Aydın, Ayhan (2006) Due date quotation in make-to-order systems with lead time sensitive customers. [Thesis]
Official URL: http://risc01.sabanciuniv.edu/record=b1160389 (Table of Contents)
Due date management is a central issue when production is triggered by customer orders. In a wide range of industries, especially if either craftsmanship is necessary or small scale project management is employed, quoting short but still attainable due dates and sustaining the highest return for the company in the long run provides an important competitive edge. In this study, we consider a single stage make-toorder manufacturing system, where customers are quoted hundred percent reliable due dates, immediately after they arrive. Lead time sensitive customers are offered price discounts in return for due dates further out. Still, quoted lead times cannot be arbitrarily long, and strict upper bounds are imposed on these depending on the type of the customer order. The scheduler does not have any information about the future arrivals in terms of their type and timing, and s/he needs to make decisions in an online setting without prior information about the arrival process or the attributes. In this thesis, a framework which evaluates the potential decisions for each order in conjunction with the current temporary production schedule is introduced. Using this framework, a group of algorithms is developed which aim to maximize the long term profit per unit time by estimating the future implications of accepting an order with a certain due date. Computational results demonstrate that under mild congestion and relatively frequent arrival of high-margin orders, this group of algorithms outperform first-come-first-served (FCFS) order selection and sequencing approach which is typical in many contexts.
|Uncontrolled Keywords:||Scheduling. -- Due date quotation. -- Make-to-order. -- Simulation. -- Online algorithms|
|Subjects:||T Technology > T Technology (General)|
|Deposited On:||15 Apr 2008 09:24|
|Last Modified:||25 Mar 2019 16:55|
Repository Staff Only: item control page