A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
From MaRDI portal
Publication:2355899
DOI10.1016/J.EJOR.2013.03.036zbMATH Open1317.90128OpenAlexW2000051282MaRDI QIDQ2355899FDOQ2355899
Authors: H. Meyr, Matthias Mann 
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.03.036
Recommendations
- Simultaneous lotsizing and scheduling on parallel machines
- The general lotsizing and scheduling problem
- Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Title not available (Why is that?)
- Decomposition Principle for Linear Programs
- Lot sizing and scheduling -- survey and extensions
- The general lotsizing and scheduling problem
- Simultaneous lotsizing and scheduling on parallel machines
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Multiple machine continuous setup lotsizing with sequence-dependent setups
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Capacitated lot-sizing with extensions: a review
- Integration of lotsizing and scheduling decisions in a job-shop
- The discrete lot-sizing and scheduling problem
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- Multi-stage simultaneous lot-sizing and scheduling for flow line production
- Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- Realizing block planning concepts in make-and-pack production using MILP modelling and SAP APO©
- An Integrated Model for Job-Shop Planning and Scheduling
- The Deterministic Dynamic Product Cycling Problem
- Studying the effects of production loss due to setup in dynamic production scheduling
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study
- An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
Cited In (13)
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification
- Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry
- Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
- Production planning under RTP, TOU and PPA considering a redox flow battery storage system
- A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production
- Time-hierarchical scheduling. A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
- Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach
- Title not available (Why is that?)
- Simultaneous lotsizing and scheduling on parallel machines
- Hybrid methods for lot sizing on parallel machines
- Simultaneous lotsizing and scheduling problems: a classification and review of models
Uses Software
This page was built for publication: A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355899)
