A review and classification on distributed permutation flowshop scheduling problems
From MaRDI portal
Publication:6069211
DOI10.1016/j.ejor.2023.02.001OpenAlexW4319264684MaRDI QIDQ6069211
Jose M. Framinan, Paz Perez-Gonzalez
Publication date: 14 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.02.001
Cites Work
- Unnamed Item
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- New hard benchmark for flowshop scheduling problems minimising makespan
- Carbon-efficient scheduling of flow shops by multi-objective optimization
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Approximation algorithms for the parallel flow shop problem
- An FPTAS for the parallel two-stage flowshop problem
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- The distributed permutation flowshop scheduling problem
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- Hybrid flexible flowshop problems: models and solution methods
- Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- A decomposition algorithm for the single machine total tardiness problem
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- The hybrid flow shop scheduling problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Benchmarks for basic scheduling problems
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- Just-in-time scheduling for a distributed concrete precast flow shop system
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel flowshop scheduling using Tabu search
- Scheduling in flowshops to minimize total tardiness of jobs
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Manufacturing Scheduling Systems
- Flowshop-scheduling problems with makespan criterion: a review
This page was built for publication: A review and classification on distributed permutation flowshop scheduling problems
