Modeling lotsizing and scheduling problems with sequence dependent setups
From MaRDI portal
Recommendations
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
- Discrete lotsizing and scheduling by batch sequencing
- The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups
- Integration of lotsizing and scheduling decisions in a job-shop
Cites work
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
- Capacitated lot-sizing with extensions: a review
- Capacitated lot-sizing with sequence dependent setup costs
- Lot sizing and scheduling -- survey and extensions
- Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
- MIP modelling of changeovers in production planning and scheduling problems
- Modeling industrial lot sizing problems: a review
- Modelling practical lot-sizing problems as mixed-integer programs
- Multiple machine continuous setup lotsizing with sequence-dependent setups
- New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
- Pricing, relaxing and fixing under lot sizing and scheduling
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Simultaneous lotsizing and scheduling on parallel machines
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- The general lotsizing and scheduling problem
- The prize collecting traveling salesman problem
Cited in
(22)- A mixed-integer programming model for an integrated production planning problem with preventive maintenance in the pulp and paper industry
- A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
- Combining GLSP and ATSP approaches to lot sizing and sequencing in the production of animal feed supplements
- Classifying and modeling setups and cleanings in lot sizing and scheduling
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings
- A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- Capacitated lot-sizing with sequence dependent setup costs
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
- The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network
- 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
- A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
- A heuristic approach for the integrated production-transportation problem with process flexibility
This page was built for publication: Modeling lotsizing and scheduling problems with sequence dependent setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297372)