Pages that link to "Item:Q706984"

The following pages link to The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984):

Displaying 50 items.

• 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)
• On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
• Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
• New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638) (← links)
• Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups (Q539458) (← links)
• Multiple machine continuous setup lotsizing with sequence-dependent setups (Q616801) (← links)
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
• Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum (Q732896) (← links)
• Capacitated lot-sizing with extensions: a review (Q926571) (← links)
• A note on ``the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q941560) (← links)
• Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic (Q1010258) (← links)
• An improved heuristic for the capacitated lot-sizing problem (Q1042705) (← links)
• Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← 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 hybrid heuristic and linear programming approach to multi-product machine scheduling (Q1303542) (← links)
• Order selection on a single machine with high set-up costs (Q1309884) (← links)
• On practical resource allocation for production planning and scheduling with period overlapping setups (Q1331600) (← links)
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
• Designing new heuristics for the capacitated lot sizing problem by genetic programming (Q1652648) (← links)
• The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model (Q1664892) (← links)
• A note on ``The general lotsizing and scheduling problem'' (Q1764206) (← links)
• Profit maximization in simultaneous lot-sizing and scheduling problem (Q1792274) (← links)
• An heuristic algorithm for a multi-product, single machine capacitated production scheduling problem (Q1818572) (← links)
• Capacitated lot-sizing with sequence dependent setup costs (Q1907207) (← links)
• A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
• A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups (Q2115789) (← links)
• New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
• A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding (Q2240342) (← links)
• Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction (Q2355104) (← 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)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
• Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
• Production planning problem with sequence dependent setups as a bilevel programming problem (Q2467304) (← links)
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← 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)
• Lead time considerations for the multi-level capacitated lot-sizing problem (Q2629719) (← links)
• Infeasibility handling in genetic algorithm using nested domains for production planning (Q2655963) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
• High Multiplicity Scheduling with Switching Costs for Few Products (Q2806978) (← links)
• Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (Q3082694) (← links)
• Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach (Q3087842) (← links)
• A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover (Q3114705) (← links)
• Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs (Q3116638) (← links)
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (Q3163748) (← links)