An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
From MaRDI portal
(Redirected from Publication:4456074)
Recommendations
- Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
- scientific article; zbMATH DE number 1816803
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
- A probabilistic analysis of the multi-period single-sourcing problem
- On solving the multi-period single-sourcing problem under uncertainty
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints
- Heuristics for the multi-resource generalized assignment problem
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
Cited in
(6)- Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
- scientific article; zbMATH DE number 1816803 (Why is no real title available?)
- Greedy approaches for a class of nonlinear generalized assignment problems
- Exact algorithms for integrated facility location and production planning problems
- A probabilistic analysis of the multi-period single-sourcing problem
- A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
This page was built for publication: An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456074)
