Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem

DOI10.1080/0305215X.2019.1607848OpenAlexW2946728784WikidataQ127825882 ScholiaQ127825882MaRDI QIDQ5059343

Yanxiang Fu, Wenzhu Liao

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2019.1607848

zbMATH Keywords

uncertaintydirected graphpermutation flow shoprobust schedulingmin-max regret

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
• Benchmarks for shop scheduling problems
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
• Benchmarks for basic scheduling problems
• Flowshop and Jobshop Schedules: Complexity and Approximation
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem