Pages that link to "Item:Q3982669"

The following pages link to Some Extensions of the Discrete Lotsizing and Scheduling Problem (Q3982669):

Displaying 34 items.

• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
• The generalized scheduling problem for discrete production. II (Q372282) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• The discrete lot-sizing and scheduling problem (Q582202) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081) (← links)
• Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem (Q1042113) (← links)
• Deterministic lotsizing models for production planning (Q1202117) (← links)
• Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows (Q1278129) (← links)
• A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem (Q1278236) (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
• The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050) (← links)
• Lotsizing and scheduling for production planning (Q1327721) (← links)
• A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
• The general lotsizing and scheduling problem (Q1374405) (← links)
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
• Multi-stage simultaneous lot-sizing and scheduling for flow line production (Q1936588) (← links)
• Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear (Q2358154) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Discrete lotsizing and scheduling by batch sequencing (Q2783968) (← links)
• Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
• Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
• Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem” (Q3116671) (← links)
• Scheduling multiple products on parallel machines with setup costs (Q3627937) (← links)
• Integrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problems (Q4399027) (← links)
• Proportional lot sizing and scheduling: Some extensions (Q4540068) (← links)
• Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs (Q5176341) (← links)
• (Q5202818) (← links)
• Modeling industrial lot sizing problems: a review (Q5385468) (← links)