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

Authors:
Feifeng Zheng;E. Zhang;Yinfeng Xu;Wei-Chiang Hong
Affiliations:
Glorious Sun School of Business and Management, Donghua University, Shanghai, P.R. China 200051 and State Key Lab for Manufacturing Systems Engineering, Xi'an, P.R. China 710049;School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, China 200433;School of Management, Xi'an Jiaotong University, Xi'an, P.R. China 710049 and State Key Lab for Manufacturing Systems Engineering, Xi'an, P.R. China 710049;Department of Information Management, Oriental Institute of Technology, Taipei, Taiwan 220
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 10
Cited 0

Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Quoting customer lead times

Management Science
Online computation and competitive analysis

Online computation and competitive analysis
Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues

Management Science
Admission control with immediate notification

Journal of Scheduling - Special issue: On-line scheduling
Effective on-line algorithms for reliable due date quotation and large-scale scheduling

Journal of Scheduling
Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs

Operations Research
Setting due dates in a stochastic single machine environment

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

Operations Research
Online preemptive scheduling with immediate decision or notification and penalties

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper makes extended studies on the discrete problem of online scheduling and reliable lead time quotation (discrete Q-SLTQ) introduced by Keskinocak et al. (Manag. Sci. 47(2):264---279, 2001). We first relax the assumption on revenue function from a linear decreasing function to any decreasing function. We present an online deterministic strategy which is optimal in competitiveness for concave revenue functions. The above results are further extended to the continuous Q-SLTQ model where orders are released at arbitrary time points. For the discrete Q-SLTQ problem, if orders are with nonuniform lengths, we prove the nonexistence of online strategies with bounded competitive ratios; otherwise if orders are with unit length but various weights, we present an optimal online strategy.