Pages that link to "Item:Q3489777"
From MaRDI portal
The following pages link to A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs (Q3489777):
Displayed 25 items.
- Optimal single machine scheduling of products with components and changeover cost (Q297186) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem (Q1042113) (← 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)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- On practical resource allocation for production planning and scheduling with period overlapping setups (Q1331600) (← links)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
- CMIT, capacitated multi-level implosion tool (Q1333500) (← links)
- A Lagrangean decomposition solution to a single line multiproduct scheduling problem (Q1342036) (← links)
- A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Production and inter-facility transportation scheduling for a process industry (Q1827648) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- Lot-size scheduling of two types of jobs on identical machines (Q1917283) (← links)
- Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
- Machine scheduling models in environmentally focused chemical manufacturing (Q4230056) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)