Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
From MaRDI portal
Publication:2147170
Recommendations
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Scheduling in flowshops to minimize total tardiness of jobs
- scientific article; zbMATH DE number 1054688
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- scientific article; zbMATH DE number 4137525
- Minimizing total completion time for flowshop scheduling problem with uncertain processing times
- Flow shop scheduling problems with time-dependent processing times on dominated machines
Cites work
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A decomposition algorithm for the single machine total tardiness problem
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- A hybrid heuristic approach for single machine scheduling with release times
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A survey of scheduling with controllable processing times
- A two-machine flow shop scheduling problem with controllable job processing times
- Adaptive memory programming for constrained global optimization
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- Benchmarks for basic scheduling problems
- Comparative evaluation of MILP flowshop models
- Computing in operations research using Julia
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- Energy-efficient scheduling in manufacturing companies: a review and research framework
- Flow shop scheduling with peak power consumption constraints
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
- Green scheduling, flows and matchings
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- Order scheduling with tardiness objective: improved approximate solutions
- Proportionate flow shop with controllable processing times
- Simple lifted cover inequalities and hard knapsack problems
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Two-machine flowshop scheduling to minimize total tardiness
- Two-machine flowshop scheduling with flexible operations and controllable processing times
- Where are the hard knapsack problems?
Cited in
(2)
This page was built for publication: Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147170)
