Effective on-line algorithms for reliable due date quotation and large-scale scheduling
From MaRDI portal
Publication:835600
DOI10.1007/s10951-008-0053-0zbMath1168.90448OpenAlexW2058021644MaRDI QIDQ835600
Zu-Hsu Lee, Philip M. Kaminsky
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.4527
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (6)
Pooling heterogeneous products for manufacturing environments ⋮ Online scheduling with immediate and reliable lead-time quotation ⋮ Competitive analysis for make-to-order scheduling with reliable lead time quotation ⋮ Online Scheduling with Increasing Subsequence Serving Constraint ⋮ Scheduling and due‐date quotation in a make‐to‐order supply chain ⋮ Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Survey of scheduling research involving due date determination decisions
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
- Setting due dates in a stochastic single machine environment
- Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
- Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues
- Optimal Lead Time Policies
- Due date assignment using artificial neural networks under different shop floor control strategies
- Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
- Probabilistic Analysis of a Machine Scheduling Problem
- The Asymptotic Optimality of the LPT Rule
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- A Single Machine Model for Determination of Optimal Due Dates and Sequence
- A Simulation Study of Predictable Due-Dates
- A Probabilistic Analysis of Two-Machine Flowshops
- The effectiveness of the longest delivery time rule for the flow shop delivery time problem
- On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem
- On the asymptotic optimality of algorithms for the flow shop problem with release dates
- Quoting Customer Lead Times
- Single Facility Due Date Setting with Multiple Customer Classes
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
This page was built for publication: Effective on-line algorithms for reliable due date quotation and large-scale scheduling
