Effective on-line algorithms for reliable due date quotation and large-scale scheduling
From MaRDI portal
Publication:835600
Recommendations
Cites work
- scientific article; zbMATH DE number 3768966 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- scientific article; zbMATH DE number 1167865 (Why is no real title available?)
- A Probabilistic Analysis of Two-Machine Flowshops
- A Simulation Study of Predictable Due-Dates
- A Single Machine Model for Determination of Optimal Due Dates and Sequence
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due date assignment using artificial neural networks under different shop floor control strategies
- 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
- Manufacturing lead-time rules: customer retention versus tardiness costs
- 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
- Optimal lead time policies
- Probabilistic Analysis of a Machine Scheduling Problem
- Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- Quoting Customer Lead Times
- Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues
- Setting due dates in a stochastic single machine environment
- Single Facility Due Date Setting with Multiple Customer Classes
- Survey of scheduling research involving due date determination decisions
- The Asymptotic Optimality of the LPT Rule
- The effectiveness of the longest delivery time rule for the flow shop delivery time problem
- Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
Cited in
(9)- Online Scheduling with Increasing Subsequence Serving Constraint
- Online MTO lead-time scheduling: a probabilistic approach
- Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size
- Online scheduling with immediate and reliable lead-time quotation
- Scheduling and due-date quotation in a make-to-order supply chain
- Competitive analysis for make-to-order scheduling with reliable lead time quotation
- Competitive Algorithms for Due Date Scheduling
- Pooling heterogeneous products for manufacturing environments
- Competitive algorithms for due date scheduling
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)
