A review and classification on distributed permutation flowshop scheduling problems
From MaRDI portal
Cites work
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A comprehensive review and evaluation of permutation flowshop heuristics
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A decomposition algorithm for the single machine total tardiness problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An FPTAS for the parallel two-stage flowshop problem
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- Approximation algorithms for the parallel flow shop problem
- Benchmarks for basic scheduling problems
- Carbon-efficient scheduling of flow shops by multi-objective optimization
- Considering scheduling and preventive maintenance in the flowshop sequencing problem
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- 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
- Flowshop-scheduling problems with makespan criterion: a review
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Hybrid flexible flowshop problems: models and solution methods
- Just-in-time scheduling for a distributed concrete precast flow shop system
- Manufacturing Scheduling Systems
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- New hard benchmark for flowshop scheduling problems minimising makespan
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel flowshop scheduling using Tabu search
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling in flowshops to minimize total tardiness of jobs
- The distributed permutation flowshop scheduling problem
- The hybrid flow shop scheduling problem
Cited in
(10)- Logic-based benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost
- Predictive model-based multi-objective optimization with life-long meta-learning for designing unreliable production systems
- Minimising makespan and total tardiness for the flowshop group scheduling problem with sequence dependent setup times
- The distributed flow shop scheduling problem with inter-factory transportation
- Two-phase optimal and heuristic algorithms for flow shop scheduling with reworks under overlapped queue time limits
- A machine learning-based decision-making framework for the green flexible flowshop scheduling problem by considering preventive maintenance
- A bi-cooperative parallel evolutionary algorithm for co-scheduling of distributed production and distribution considering shared transportation resources
- Fifty years of research in scheduling -- theory and applications
- Heuristic algorithms based on multi-stage or adaptive strategies for a distributed heterogeneous permutation flowshop scheduling problem with release time
- The distributed no-idle permutation flowshop scheduling problem with due windows
This page was built for publication: A review and classification on distributed permutation flowshop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069211)
