Online scheduling with immediate and reliable lead-time quotation
From MaRDI portal
Publication:398920
DOI10.1007/s10951-013-0363-8zbMath1297.90063OpenAlexW2049575906MaRDI QIDQ398920
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
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- On-line scheduling of jobs with fixed start and end times
- Admission control with immediate notification
- Pricing and scheduling decisions with leadtime flexibility
- 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
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
- Online Scheduling of Equal-Length Jobs on Parallel Machines
- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
- Approximation and Online Algorithms