An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time

DOI10.1007/s10878-020-00594-0zbMath1503.90052OpenAlexW3028894538MaRDI QIDQ2084598

Long Zhang, Qingguo Bai, Yu-Zhong Zhang

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00594-0

zbMATH Keywords

approximation algorithmsupply chain schedulingfully polynomial-time approximation schemeholding timedue window assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Supply chain scheduling to minimize holding costs with outsourcing
• Scheduling a maintenance activity and due-window assignment on a single machine
• Optimal common due-date with limited completion time deviation
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• Determination of common due window location in a single machine scheduling problem
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Earliness-tardiness scheduling problems with a common delivery window
• Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
• Two-stage medical supply chain scheduling with an assignable common due window and shelf life
• Single-machine common due window assignment and scheduling to minimize the total cost
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• Common due window size and location determination in a single machine scheduling problem
• A due-window assignment problem with position-dependent processing times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows
• Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs
• Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This page was built for publication: An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time