Online scheduling with immediate and reliable lead-time quotation

DOI10.1007/S10951-013-0363-8MaRDI QIDQ398920zbMATH OpenOpenAlexFDO

Authors Feifeng Zheng, Yinfeng Xu, Weimin Ma, E. Zhang

Publication date 18 August 2014

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-013-0363-8

zbMATH Keywords

schedulingcompetitive ratioonline strategylead-time quotation

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Competitive analysis for make-to-order scheduling with reliable lead time quotation
• Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
• Competitive Algorithms for Due Date Scheduling
• Competitive algorithms for due date scheduling
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
• Admission control with immediate notification
• Approximation and Online Algorithms
• Due date assignment using artificial neural networks under different shop floor control strategies
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling
• ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
• On-line scheduling of jobs with fixed start and end times
• Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
• Online Scheduling of Equal-Length Jobs on Parallel Machines
• Pricing and scheduling decisions with leadtime flexibility
• Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues

Cited in

(6)

• Algorithmic Applications in Management
• Competitive Algorithms for Due Date Scheduling
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling
• Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
• Competitive algorithms for due date scheduling
• Online MTO lead-time scheduling: a probabilistic approach

This page was built for publication: Online scheduling with immediate and reliable lead-time quotation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398920)