Pages that link to "Item:Q1331600"
From MaRDI portal
The following pages link to On practical resource allocation for production planning and scheduling with period overlapping setups (Q1331600):
Displayed 46 items.
- Optimization-based heuristics for underground mine scheduling (Q299816) (← links)
- Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator (Q331763) (← links)
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty (Q336654) (← links)
- Fix-and-relax approaches for controlled tabular adjustment (Q337507) (← links)
- MILP-based heuristics for the design of rural community electrification projects (Q342343) (← links)
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
- Using and extending fix-and-relax to solve maritime inventory routing problems (Q356520) (← links)
- A heuristic block coordinate descent approach for controlled tabular adjustment (Q547141) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem (Q724143) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- A mixed integer programming model for advanced planning and scheduling (APS) (Q872302) (← links)
- On a stochastic sequencing and scheduling problem (Q875406) (← links)
- Capacitated lot-sizing with extensions: a review (Q926571) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic (Q1010258) (← links)
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty (Q1010297) (← links)
- On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty (Q1026569) (← links)
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem (Q1027560) (← links)
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
- Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
- Mixed integer programming based heuristics for the patient admission scheduling problem (Q1652186) (← links)
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon (Q1688448) (← links)
- Optimization model for a production, inventory, distribution and routing problem in small furniture companies (Q1752350) (← links)
- On risk management of a two-stage stochastic mixed 0-1 model for the closed-loop supply chain design problem (Q1755235) (← links)
- A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints (Q2140318) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs (Q2483511) (← links)
- Fix and relax heuristic for a stochastic lot-sizing problem (Q2506172) (← links)
- Airport management: taxi planning (Q2507387) (← links)
- A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem (Q2669624) (← links)
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
- MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups (Q3163316) (← links)
- Optimizing assignment of Tomahawk cruise missile missions to firing units (Q3168961) (← links)
- Multi-item capacitated lot-sizing with demand uncertainty (Q3527918) (← links)
- Using genetic algorithms (GA) and a coloured timed Petri net (CTPN) for modelling the optimization-based schedule generator of a generic production scheduling system (Q5438649) (← links)
- Robust optimization applied to uncertain production loading problems with import quota limits under the global supply chain management environment (Q5478835) (← links)
- A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy (Q6048039) (← links)
- Cross-dock facility for disaster relief operations (Q6099460) (← links)
- Multi-period single-allocation hub location-routing: models and heuristic solutions (Q6113308) (← links)
- A review of decentralized optimization focused on information flows of decomposition algorithms (Q6164389) (← links)