Changeover formulations for discrete-time mixed-integer programming scheduling models
From MaRDI portal
Publication:1753514
DOI10.1016/j.ejor.2017.01.004zbMath1403.90373OpenAlexW2571324214MaRDI QIDQ1753514
Yachao Dong, Christos T. Maravelias, Sara Velez
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.004
Integer programming (90C10) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
An improved decision support model for scheduling production in an engineer-to-order manufacturer ⋮ Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Integrated methods for optimization.
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
- A time indexed formulation of non-preemptive single machine scheduling problems
- MIP modelling of changeovers in production planning and scheduling problems
- A polyhedral approach to single-machine scheduling problems.
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Optimal periodic scheduling of multipurpose batch plants
- Single-facility scheduling by logic-based Benders decomposition
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
- Planning and Scheduling by Logic-Based Benders Decomposition
- Multi-Product Inventory Logistics Modeling in the Process Industries
- The Deterministic Dynamic Product Cycling Problem
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
This page was built for publication: Changeover formulations for discrete-time mixed-integer programming scheduling models
