Effective on-line algorithms for reliable due date quotation and large-scale scheduling
type: Item
instance of: scholarly article
title: Effective on-line algorithms for reliable due date quotation and large-scale scheduling
zbMATH Open document ID: 1168.90448
author: Zu-Hsu Lee
author: Philip Kaminsky
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 5599855
zbMATH Keywords: due date quotation
zbMATH Keywords: scheduling
zbMATH Keywords: on-line algorithms
zbMATH Keywords: asymptotic analysis
zbMATH Keywords: probabilistic analysis
MaRDI profile type: Publication
OpenAlex ID: W2058021644
cites work: Q4396949
cites work: A Single Machine Model for Determination of Optimal Due Dates and Sequence
cites work: Survey of scheduling research involving due date determination decisions
cites work: Q3949968
cites work: Single Facility Due Date Setting with Multiple Customer Classes
cites work: Quoting Customer Lead Times
cites work: The Asymptotic Optimality of the LPT Rule
cites work: Probabilistic Analysis of a Machine Scheduling Problem
cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
cites work: Due date assignment using artificial neural networks under different shop floor control strategies
cites work: The effectiveness of the longest delivery time rule for the flow shop delivery time problem
cites work: Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
cites work: Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
cites work: Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues
cites work: Q4124328
cites work: On the asymptotic optimality of algorithms for the flow shop problem with release dates
cites work: Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
cites work: Setting due dates in a stochastic single machine environment
cites work: A Probabilistic Analysis of Two-Machine Flowshops
cites work: Q4367948
cites work: Manufacturing lead-time rules: customer retention versus tardiness costs
cites work: Probabilistic analysis of the minimum weighted flowtime scheduling problem
cites work: Optimal Lead Time Policies
cites work: Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
cites work: A Simulation Study of Predictable Due-Dates
cites work: Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue
cites work: On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem
DOI: 10.1007/S10951-008-0053-0
description: scientific article; zbMATH DE number 5599855