Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs

DOI10.1007/s10951-014-0396-7zbMath1310.90012OpenAlexW2123331415MaRDI QIDQ2018942

Rui Zhang, Sorina Dumitrescu, George Steiner

Publication date: 26 March 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0396-7

zbMATH Keywords

schedulingapproximation algorithmtardinessdelivery times

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Manufacturing lead-time rules: customer retention versus tardiness costs
• Two due date assignment problems in scheduling a single machine
• Fast approximation algorithm for job sequencing with deadlines
• Coordinated supply chain management
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• A survey of the state-of-the-art of common due date assignment and scheduling research
• A fully polynomial approximation scheme for the total tardiness problem
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Integrated Scheduling of Production and Distribution Operations
• Supply Chain Scheduling: Batching and Delivery
• Algorithms for Scheduling Independent Tasks
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs