Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach
From MaRDI portal
Publication:2158042
DOI10.1016/j.ejor.2022.02.054OpenAlexW4214899094MaRDI QIDQ2158042
Guilherme Luz Tortorella, Alejandro Mac Cawley, Rodrigo Pascual, Sergio V. Maturana
Publication date: 22 July 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.054
Related Items (2)
A sustainable inventory model to study the mixing and bottling plant of single item for cost minimization ⋮ Pricing and structuring product trials: separate versus mixed wine tastings
Cites Work
- Unnamed Item
- Modeling lotsizing and scheduling problems with sequence dependent setups
- The third comprehensive survey on scheduling problems with setup times/costs
- Robust scheduling of wireless sensor networks for target tracking under uncertainty
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
- The production scheduling problem in a multi-page invoice printing system
- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- An iterative approach to robust and integrated aircraft routing and crew scheduling
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
- The general lotsizing and scheduling problem
- Simultaneous lotsizing and scheduling on parallel machines
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification
- A survey of scheduling problems with no-wait in process
- Classifying and modeling setups and cleanings in lot sizing and scheduling
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations
- A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A survey of scheduling problems with setup times or costs
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty
- A Robust Optimization Approach to Inventory Theory
- The Price of Robustness
- Robust deterministic scheduling in stochastic environments: The method of capacity hedge points
- Constructing robust crew schedules with bicriteria optimization
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Schedule instability, service level and cost in a material requirements planning system
- Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
This page was built for publication: Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach