MIP modelling of changeovers in production planning and scheduling problems
From MaRDI portal
Publication:1278814
DOI10.1016/S0377-2217(97)89646-4zbMath0923.90088MaRDI QIDQ1278814
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
surveyproduction planningvalid inequalitieslot-sizingmachine sequencinginterval submodular inequalities
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items
Hierarchical approach to production scheduling in make-to-order assembly, Simultaneous lotsizing and scheduling problems: a classification and review of models, Modeling lotsizing and scheduling problems with sequence dependent setups, New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches, On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay, On a stochastic sequencing and scheduling problem, Multiple machine continuous setup lotsizing with sequence-dependent setups, Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches., Modeling industrial lot sizing problems: a review, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Production planning problem with sequence dependent setups as a bilevel programming problem, Changeover formulations for discrete-time mixed-integer programming scheduling models, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Scheduling projects with labor constraints, Fix and relax heuristic for a stochastic lot-sizing problem, A new MIP model for mine equipment scheduling by minimizing maintenance cost, On stochastic dynamic programming for solving large-scale planning problems under uncertainty, Multi-Product Inventory Logistics Modeling in the Process Industries, Optimal planning in large multi-site production networks, Simultaneous lotsizing and scheduling on parallel machines, A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups, Two alternative models for farm management: Discrete versus continuous time horizon, On a fix-and-relax framework for a class of project scheduling problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- A time indexed formulation of non-preemptive single machine scheduling problems
- New classes of efficiently solvable generalized traveling salesman problems
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Optimal periodic scheduling of multipurpose batch plants
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- A Dynamic Programming Approach to Sequencing Problems
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- The Deterministic Dynamic Product Cycling Problem
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- Scheduling target illuminators in naval battle-group anti-air warfare
