Pages that link to "Item:Q3200871"
From MaRDI portal
The following pages link to A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871):
Displaying 13 items.
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) (← links)
- Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers (Q958558) (← links)
- Finite horizon planning with fixed-interval deliveries and no shortage (Q998721) (← links)
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities (Q1040690) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
- Polynomial algorithms for single machine scheduling problems with financial constraints (Q1371954) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem (Q3741359) (← links)
- Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases (Q5926599) (← links)
