Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues

被引:81
作者
Keskinocak, P [1 ]
Ravi, R
Tayur, S
机构
[1] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
[2] Carnegie Mellon Univ, Grad Sch Ind Adm, Pittsburgh, PA 15213 USA
关键词
lead-time quotation; online algorithms; competitive ratio; complexity; scheduling;
D O I
10.1287/mnsc.47.2.264.9836
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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 the immediate 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 the delayed quotation model, which we study briefly. The analysis of these models provides useful qualitative insights as well.
引用
收藏
页码:264 / 279
页数:16
相关论文
共 34 条
[1]   SCHEDULING JOBS WITH FIXED START AND END TIMES [J].
ARKIN, EM ;
SILVERBERG, EB .
DISCRETE APPLIED MATHEMATICS, 1987, 18 (01) :1-8
[2]   A COMPARISON OF DUE-DATE SELECTION-RULES [J].
BAKER, KR ;
BERTRAND, JWM .
AIIE TRANSACTIONS, 1981, 13 (02) :123-131
[3]   SEQUENCING RULES AND DUE-DATE ASSIGNMENTS IN A JOB SHOP [J].
BAKER, KR .
MANAGEMENT SCIENCE, 1984, 30 (09) :1093-1104
[4]  
BAKER KR, 1982, J OPER MANAG, V3, P37, DOI DOI 10.1016/0272-6963(82)90020-1
[5]   THE EFFECT OF WORKLOAD DEPENDENT DUE-DATES ON JOB SHOP PERFORMANCE [J].
BERTRAND, JWM .
MANAGEMENT SCIENCE, 1983, 29 (07) :799-816
[6]  
BOOKBINDER JH, 1985, J OPER RES SOC, V36, P1017, DOI 10.1057/jors.1985.181
[7]  
Borodin A, 1998, ONLINE COMPUTATION C
[8]   A SINGLE-MACHINE MODEL FOR DETERMINATION OF OPTIMAL DUE DATES AND SEQUENCE [J].
CHAND, S ;
CHHAJED, D .
OPERATIONS RESEARCH, 1992, 40 (03) :596-602
[9]   SURVEY OF SCHEDULING RESEARCH INVOLVING DUE DATE DETERMINATION DECISIONS [J].
CHENG, TCE ;
GUPTA, MC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :156-166
[10]  
CHENG TCE, 1984, J OPER RES SOC, V35, P433