A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
From MaRDI portal
Publication:6070118
DOI10.1111/itor.12862MaRDI QIDQ6070118
Angel A. Juan, Javier Panadero, Unnamed Author, Luciana S. Pessoa, Unnamed Author
Publication date: 20 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
stochastic processing timespermutation flow-shop problemcumulative payoffssimheuristicsbiased-randomized algorithmsdeliver dates
Related Items (4)
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ A variable neighborhood search simheuristic algorithm for reliability optimization of smart grids under uncertainty ⋮ An enhanced GRASP approach for the index tracking problem ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
Cites Work
- Unnamed Item
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- On optimizing a bi-objective flowshop scheduling problem in an uncertain environment
- On the conditional value-at-risk probability-dependent utility function
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- On three-machine flow shops with random job processing times
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Single machine scheduling with delivery dates and cumulative payoffs
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- Coherent Measures of Risk
- Optimal two- and three-stage production schedules with setup times included
- Optimization by GRASP
- Reducing mean flow time in permutation flow shop
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Variable Neighborhood Search
- A biased‐randomized metaheuristic for the capacitated location routing problem
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
This page was built for publication: A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
