HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
DOI10.1016/J.EJOR.2013.10.017zbMATH Open1305.90020OpenAlexW2097162789MaRDI QIDQ2256197FDOQ2256197
Authors: Victor C. B. Camargo, Franklina M. B. Toledo, Bernardo Almada-Lobo 
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://repositorio-aberto.up.pt/handle/10216/73443
Recommendations
- Lotsizing and scheduling for production planning
- Production scheduling problems in a textile industry
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Statistical search methods for lotsizing problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)
Cites Work
- Modelling practical lot-sizing problems as mixed-integer programs
- Benchmarking optimization software with performance profiles.
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Error detecting and error correcting codes
- Local branching
- The feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Lot sizing and scheduling -- survey and extensions
- The general lotsizing and scheduling problem
- Simultaneous lotsizing and scheduling on parallel machines
- Single item lot sizing problems
- Title not available (Why is that?)
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Lagrangean relaxation based heuristics for lot sizing with setup times
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
- DINS, a MIP Improvement Heuristic
- Production scheduling problems in a textile industry
Cited In (9)
- Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
- A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification
- Mixed integer programming based heuristics for the patient admission scheduling problem
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
- Mathematical programming-based approaches for multi-facility Glass container production planning
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Exact optimization and decomposition approaches for shelf space allocation
Uses Software
This page was built for publication: HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256197)
