Effective on-line algorithms for reliable due date quotation and large-scale scheduling
DOI10.1007/S10951-008-0053-0zbMATH Open1168.90448OpenAlexW2058021644MaRDI QIDQ835600FDOQ835600
Authors: Zu-Hsu Lee, Philip 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
Recommendations
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Title not available (Why is that?)
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Title not available (Why is that?)
- Survey of scheduling research involving due date determination decisions
- Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
- Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue
- Quoting Customer Lead Times
- Single Facility Due Date Setting with Multiple Customer Classes
- Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
- Optimal lead time policies
- Setting due dates in a stochastic single machine environment
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Title not available (Why is that?)
- On the asymptotic optimality of algorithms for the flow shop problem with release dates
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- 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
- A Single Machine Model for Determination of Optimal Due Dates and Sequence
- A Simulation Study of Predictable Due-Dates
- The Asymptotic Optimality of the LPT Rule
- Probabilistic Analysis of a Machine Scheduling Problem
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
- Title not available (Why is that?)
- 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
Cited In (9)
- Online scheduling with immediate and reliable lead-time quotation
- Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size
- Scheduling and due-date quotation in a make-to-order supply chain
- Competitive Algorithms for Due Date Scheduling
- Pooling heterogeneous products for manufacturing environments
- Online Scheduling with Increasing Subsequence Serving Constraint
- Competitive analysis for make-to-order scheduling with reliable lead time quotation
- Competitive algorithms for due date scheduling
- Online MTO lead-time scheduling: a probabilistic approach
This page was built for publication: Effective on-line algorithms for reliable due date quotation and large-scale scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835600)
