Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
From MaRDI portal
Publication:958458
DOI10.1016/j.cor.2008.01.007zbMath1160.90490OpenAlexW2038757212MaRDI QIDQ958458
G. I. Zobolas, Christos D. Tarantilis, George Ioannou
Publication date: 4 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.01.007
Related Items
A real-time order acceptance and scheduling approach for permutation flow shop problems ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ An uncertain permutation flow shop predictive scheduling problem with processing interruption ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Flow shop scheduling with heterogeneous workers ⋮ A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion ⋮ Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Variable neighbourhood search: methods and applications ⋮ A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ Variable neighbourhood search: Methods and applications
Cites Work
- Scheduling flow shops using differential evolution algorithm
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for the job shop problem
- Heuristics for scheduling in flowshop with multiple objectives
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An ant colony system for permutation flow-shop sequencing
- A hybrid genetic algorithm for the open shop scheduling problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Benchmarks for basic scheduling problems
- A hybrid genetic algorithm for the job shop scheduling problem
- Optimal two- and three-stage production schedules with setup times included
- The Complexity of Flowshop and Jobshop Scheduling
- Bottleneck-focused scheduling for a hybrid flowshop
- A guide to vehicle routing heuristics
- A genetic algorithm for flow shop scheduling problems
- Sequencing CONWIP flow-shops: Analysis and heuristics
- An effective heuristic for the CLSP with set-up times
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Variable neighborhood search: Principles and applications
