Pages that link to "Item:Q547140"

The following pages link to Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140):

Displaying 24 items.

• Modeling lotsizing and scheduling problems with sequence dependent setups (Q297372) (← links)
• A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
• Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator (Q331763) (← links)
• Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← 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)
• On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
• Mixed integer programming based heuristics for the patient admission scheduling problem (Q1652186) (← links)
• Optimization model for a production, inventory, distribution and routing problem in small furniture companies (Q1752350) (← links)
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
• New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
• Hybrid stochastic and robust optimization model for lot-sizing and scheduling problems under uncertainties (Q2178069) (← links)
• A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production (Q2178114) (← links)
• Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
• A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding (Q2240342) (← links)
• HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← links)
• Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
• Pricing, relaxing and fixing under lot sizing and scheduling (Q2355959) (← links)
• Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry (Q2358497) (← links)
• Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
• A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production (Q2669527) (← links)
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)