Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues

Authors:
Pinar Keskinocak;R. Ravi;Sridhar Tayur
Affiliations:
-;-;-
Venue:
Management Science
Year:
2001

Citing 0
Cited 14

Effective on-line algorithms for reliable due date quotation and large-scale scheduling

Journal of Scheduling
Sensitivity of Optimal Capacity to Customer Impatience in an Unobservable M/M/S Queue (Why You Shouldn't Shout at the DMV)

Manufacturing & Service Operations Management
Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs

Operations Research
Dynamic Lead-Time Quotation for an M/M/1 Base-Stock Inventory Queue

Operations Research
Resource Allocation Policies for Personalization in Content Delivery Sites

Information Systems Research
Editorial: How to Monetize the Value of OR

Interfaces
Developing a two stage stochastic programming model of the price and lead-time decision problem in the multi-class make-to-order firm

Computers and Industrial Engineering
A new decision making structure for managing arriving orders in MTO environments

Expert Systems with Applications: An International Journal
The capacity planning problem in make-to-order enterprises

Mathematical and Computer Modelling: An International Journal
Competitive algorithms for due date scheduling

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Congestion-based leadtime quotation and pricing for revenue maximization with heterogeneous customers

Queueing Systems: Theory and Applications
Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions

Operations Research
Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions

Operations Research
Competitive analysis for make-to-order scheduling with reliable lead time quotation

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

Motivated by applications in the manufacturing and service industries, we consider two models for coordinating scheduling with lead-time quotation: a basic model with a single customer type, and an enhanced model where an additional second customer type expects immediate service or production. In both models, revenues obtained from the customers are sensitive to the lead time, there is a threshold of lead time above which the customer does not place an order, and the quoted lead times are 100% reliable. These models are related to well-known scheduling problems, which have been studied in both offline and online settings.We introduce theimmediate quotation case and study it with the (traditional) online version. We provide complexity results for the offline case, and perform competitive analysis for the online cases. A natural question of bridging the gap between the online and quotation models leads us to thedelayed quotation model, which we study briefly. The analysis of these models provides useful qualitative insights as well.