The distributed permutation flowshop scheduling problem
From MaRDI portal
Publication:1040975
DOI10.1016/j.cor.2009.06.019zbMath1176.90237OpenAlexW2073601282MaRDI QIDQ1040975
Publication date: 27 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.019
mixed integer linear programmingvariable neighborhood descentdistributed schedulingpermutation flowshop
Related Items
A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ 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 ⋮ A knowledge-based approach for multi-factory production systems ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints ⋮ Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition ⋮ 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 ⋮ Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ A branch-and-cut approach for the distributed no-wait flowshop scheduling problem ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Maximizing total early work in a distributed two‐machine flow‐shop ⋮ 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 ⋮ Collaborative Operating Room Planning and Scheduling ⋮ Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ Flowshop scheduling problem with parallel semi-lines and final synchronization operation ⋮ Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling
Cites Work
- Unnamed Item
- Scheduling flow shops using differential evolution algorithm
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- Modeling realistic hybrid flexible flowshop scheduling problems
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- Variable neighborhood search
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A comprehensive review and evaluation of permutation flowshop heuristics
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- A study of integer programming formulations for 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
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Comparative evaluation of MILP flowshop models
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- 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 problems with makespan criterion: a review
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Problems in the Analysis of Survey Data, and a Proposal
- Variable neighborhood search: Principles and applications
