Scheduling and due‐date quotation in a make‐to‐order supply chain

DOI10.1002/nav.20297zbMath1209.90172OpenAlexW2096349918MaRDI QIDQ5393028

Onur Kaya, Philip M. Kaminsky

Publication date: 15 April 2011

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20297

zbMATH Keywords

schedulingsupply chain managementdue-date quotation

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A scheduling model of logistics service supply chain based on the time windows of the FLSP's operation and customer requirement ⋮ Research on optimization of production decision based on payment time and price coordination

Cites Work

• Unnamed Item
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling
• 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
• Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
• Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
• 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
• 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: Scheduling and due‐date quotation in a make‐to‐order supply chain