Pages that link to "Item:Q1198326"

The following pages link to Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326):

Displaying 32 items.

• A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) (← links)
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) (← links)
• An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem (Q961468) (← links)
• Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study (Q998715) (← links)
• Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem (Q1042113) (← links)
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
• Solution of a tinned iron purchasing problem by Lagrangean relaxation (Q1130077) (← links)
• Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
• Efficient post-optimization analysis procedure for the dynamic lot-sizing problem (Q1261343) (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
• A Lagrangean decomposition solution to a single line multiproduct scheduling problem (Q1342036) (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← links)
• Lagrangian relaxation and constraint generation for allocation and advanced scheduling (Q1761167) (← links)
• Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
• A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
• A new algorithm of the CSLLSP in CIMS (Q2725092) (← links)
• Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs (Q3182664) (← links)
• (Q3348687) (← links)
• A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems (Q3582665) (← links)
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) (← links)
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition (Q3780738) (← links)
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing (Q4015264) (← links)
• Dynamic Production Scheduling for a Process Industry (Q4305752) (← links)
• Capacitated lot sizing with alternative routings and overtime decisions (Q5438625) (← links)