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

DOI10.1007/s10878-012-9502-yzbMath1286.90072OpenAlexW1968693642MaRDI QIDQ2436673

Yanyan Li

Publication date: 25 February 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9502-y

zbMATH Keywords

schedulingcompetitive ratioonline strategylead time quotation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Dynamic work hour optimization for casual workers

Cites Work

• Unnamed Item
• Manufacturing lead-time rules: customer retention versus tardiness costs
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling
• Admission control with immediate notification
• Setting due dates in a stochastic single machine environment
• Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs
• Dynamic Lead-Time Quotation for an M/M/1 Base-Stock Inventory Queue
• Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues
• Due date assignment using artificial neural networks under different shop floor control strategies
• Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Quoting Customer Lead Times