Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry

Related Items (1)

A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

Cites Work

Unnamed Item
Unnamed Item
On heuristic solutions for the stochastic flowshop scheduling problem
Several flow shop scheduling problems with truncated position-based learning effect
Single machine scheduling problem with interval processing times to minimize mean weighted completion time
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
On the robust single machine scheduling problem
Algorithms and complexity analysis for robust single-machine scheduling problems
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
Min-max and min-max regret versions of combinatorial optimization problems: A survey
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
Robust solutions of linear programming problems contaminated with uncertain data
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
Minimizing total weighted flow time under uncertainty using dominance and a stability box
A family of inequalities valid for the robust single machine scheduling polyhedron
A new heuristic for the n-job, M-machine flow-shop problem
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
Multi-process production scheduling with variable renewable integration and demand response
Robust scheduling with budgeted uncertainty
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
Two MILP models for the N × M SDST flowshop sequencing problem
Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
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
ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
An Improved Formulation for the Job-Shop Scheduling Problem
A General Bounding Scheme for the Permutation Flow-Shop Problem
The Complexity of Flowshop and Jobshop Scheduling
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Tight Bounds for Permutation Flow Shop Scheduling
Scheduling

This page was built for publication: Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry