Pages that link to "Item:Q2483511"

The following pages link to Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs (Q2483511):

Displayed 23 items.

• Personnel scheduling and supplies provisioning in emergency relief operations (Q256662) ‎ (← links)
• A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem (Q337043) ‎ (← links)
• A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) ‎ (← links)
• Mathematical programming-based approaches for multi-facility Glass container production planning (Q342464) ‎ (← links)
• Using and extending fix-and-relax to solve maritime inventory routing problems (Q356520) ‎ (← links)
• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) ‎ (← links)
• Multi-level single machine lot-sizing and scheduling with zero lead times (Q621969) ‎ (← links)
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) ‎ (← links)
• Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness (Q639194) ‎ (← links)
• SICOpt: Solution approach for nonlinear integer stochastic programming problems (Q1039361) ‎ (← links)
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) ‎ (← links)
• A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches (Q1652514) ‎ (← links)
• Optimization model for a production, inventory, distribution and routing problem in small furniture companies (Q1752350) ‎ (← links)
• Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount (Q1954948) ‎ (← links)
• A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production (Q2178114) ‎ (← links)
• HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) ‎ (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) ‎ (← links)
• Fix and relax heuristic for a stochastic lot-sizing problem (Q2506172) ‎ (← links)
• Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops (Q2826667) ‎ (← links)
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) ‎ (← links)
• A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) ‎ (← links)
• Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating (Q6091882) ‎ (← links)
• Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry (Q6168345) ‎ (← links)