The distributed permutation flowshop scheduling problem
From MaRDI portal
Recommendations
- Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop
Cites work
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- 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 simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A study of integer programming formulations for scheduling problems
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An empirical analysis of the optimality rate of flow shop heuristics
- An improved NEH-based heuristic for the permutation flowshop problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Comparative evaluation of MILP flowshop models
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Flowshop scheduling research after five decades
- Flowshop-scheduling problems with makespan criterion: a review
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Modeling realistic hybrid flexible flowshop scheduling problems
- New MILP models for the permutation flowshop problem
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Problems in the Analysis of Survey Data, and a Proposal
- Scheduling flow shops using differential evolution algorithm
- Some efficient heuristic methods for the flow shop sequencing problem
- The Complexity of Flowshop and Jobshop Scheduling
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
Cited in
(47)- Hybrid flexible flowshop problems: models and solution methods
- Just-in-time scheduling for a distributed concrete precast flow shop system
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
- Flow shop scheduling with heterogeneous workers
- Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A review and classification on distributed permutation flowshop scheduling problems
- Survey on optimization algorithms for distributed shop scheduling
- The distributed no-idle permutation flowshop scheduling problem with due windows
- Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- New effective MILP models for PFSPs arising from real applications
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- Collaborative operating room planning and scheduling
- MILP models for the optimization of real production lines
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- Makespan distribution of permutation flowshop schedules
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Maximizing total early work in a distributed two‐machine flow‐shop
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
- Matheuristic for the decentralized factories scheduling problem
- Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
- Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
- Minimizing the total completion time in a distributed two stage assembly system with setup times
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation
- Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem
- Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
- A knowledge-based approach for multi-factory production systems
This page was built for publication: The distributed permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040975)
