Pages that link to "Item:Q2492672"

The following pages link to An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672):

Displaying 23 items.

• Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
• A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
• A graphical approach to solve an investment optimization problem (Q483269) (← links)
• A new effective dynamic program for an investment optimization problem (Q505320) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• Multi-machine scheduling with interval constrained position-dependent processing times (Q1716992) (← links)
• NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
• An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← links)
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
• Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation (Q2029277) (← links)
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
• Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
• Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures (Q2251740) (← links)
• Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
• A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
• Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
• An FPTAS for SM‐CELS problem with monotone cost functions (Q3579135) (← links)
• Lot-Sizing and Sequencing on a Single Imperfect Machine (Q3627683) (← links)
• Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)