Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
From MaRDI portal
Publication:2147170
DOI10.1016/j.cor.2022.105880OpenAlexW4281390184MaRDI QIDQ2147170
Victor Fernandez-Viagas, Bruno de Athayde Prata, Jose M. Framinan, Carlos Diego Rodrigues
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105880
flowshop schedulingmixed-integer linear programmingsustainable manufacturingproduction sequencingheuristic cutting planes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Energy-efficient scheduling in manufacturing companies: a review and research framework
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
- A hybrid heuristic approach for single machine scheduling with release times
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- Two-machine flowshop scheduling with flexible operations and controllable processing times
- Flow shop scheduling with peak power consumption constraints
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- A two-machine flow shop scheduling problem with controllable job processing times
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Order scheduling with tardiness objective: improved approximate solutions
- Where are the hard knapsack problems?
- A decomposition algorithm for the single machine total tardiness problem
- Proportionate flow shop with controllable processing times
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- Green scheduling, flows and matchings
- Benchmarks for basic scheduling problems
- Adaptive memory programming for constrained global optimization
- A survey of scheduling with controllable processing times
- Simple lifted cover inequalities and hard knapsack problems
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- Computing in Operations Research Using Julia
- Two-machine flowshop scheduling to minimize total tardiness
- Comparative evaluation of MILP flowshop models
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
