Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
New hard benchmark for flowshop scheduling problems minimising makespan
On heuristic solutions for the stochastic flowshop scheduling problem
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
Variable neighborhood search
Robust solutions of linear programming problems contaminated with uncertain data
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
Greedy randomized adaptive search procedures
A simple and effective metaheuristic for the minimum latency problem
A fuzzy-budgeted robust optimization model for joint network design-pricing problem in a forward-reverse supply chain: the viewpoint of third-party logistics
Benchmarks for basic scheduling problems
Schedule execution for two-machine flow-shop with interval processing times
Solving two-stage robust optimization problems using a column-and-constraint generation method
Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
The minmax regret permutation flow-shop problem with two jobs
Exact solutions for the two-machine robust flow shop with budgeted uncertainty
A grasp for job shop scheduling
Optimal two- and three-stage production schedules with set-up time included
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
New MILP models for the permutation flowshop problem
The Price of Robustness
On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
The Complexity of Flowshop and Jobshop Scheduling
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
THE PROBABLE ERROR OF A MEAN
Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
Fuzzy sets
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry

This page was built for publication: Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588503)