Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

From MaRDI portal
Revision as of 18:47, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (17)

A real-time order acceptance and scheduling approach for permutation flow shop problemsA multi-agent based cooperative approach to scheduling and routingTwo simple and effective heuristics for minimizing the makespan in non-permutation flow shopsA binary multiple knapsack model for single machine scheduling with machine unavailabilityAn uncertain permutation flow shop predictive scheduling problem with processing interruptionSynergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problemA new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluationFlow shop scheduling with heterogeneous workersA hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterionHeuristics and metaheuristics for mixed blocking constraints flowshop scheduling problemsAn iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup timesVariable neighbourhood search: methods and applicationsA hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup timesFast heuristics for minimizing the makespan in non-permutation flow shopsSOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHMUsing iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issuesVariable neighbourhood search: Methods and applications




Cites Work




This page was built for publication: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm