An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
From MaRDI portal
Publication:2084598
Recommendations
- Two-stage supply chain scheduling with an assignable common due window
- Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
- Single-machine common due window assignment and scheduling to minimize the total cost
- scientific article; zbMATH DE number 6832017
- Minmax scheduling problems with a common due-window
Cites work
- A due-window assignment problem with position-dependent processing times
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
- Common due window size and location determination in a single machine scheduling problem
- Determination of common due window location in a single machine scheduling problem
- Earliness-tardiness scheduling problems with a common delivery window
- scientific article; zbMATH DE number 6832017 (Why is no real title available?)
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Optimal common due-date with limited completion time deviation
- Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a maintenance activity and due-window assignment on a single machine
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Single-machine common due window assignment and scheduling to minimize the total cost
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Supply chain scheduling to minimize holding costs with outsourcing
- Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life
Cited in
(7)- Two-stage medical supply chain scheduling with an assignable common due window and shelf life
- Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
- scientific article; zbMATH DE number 6832017 (Why is no real title available?)
- Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
- Two-stage supply chain scheduling with an assignable common due window
- Minmax common due-window assignment scheduling with deteriorating jobs
- Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components
This page was built for publication: An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084598)
