An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
From MaRDI portal
Publication:959513
DOI10.1016/j.cor.2008.04.001zbMath1177.90153OpenAlexW2081684339MaRDI QIDQ959513
Xingye Dong, Ping Chen, Houkuan Huang
Publication date: 17 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.04.001
Related Items
An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ A single machine scheduling problem with two-dimensional vector packing constraints ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ Local search methods for the flowshop scheduling problem with flowtime minimization ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ An ILS heuristic for the ship scheduling problem: application in the oil industry ⋮ Linear programing relaxations for a strategic pricing problem in electricity markets ⋮ Meta-heuristic algorithms for solving a fuzzy single-period problem ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ An application of genetic algorithm to a bidding problem in electricity markets
Cites Work
- Unnamed Item
- 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
- Flowshop sequencing with mean flowtime objective
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- The two-machine total completion time flow shop problem
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Combining simulated annealing with local search heuristics
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Optimal two- and three-stage production schedules with setup times included
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- The Complexity of Flowshop and Jobshop Scheduling
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
