Local search methods for the flowshop scheduling problem with flowtime minimization
From MaRDI portal
Publication:1926908
DOI10.1016/j.ejor.2012.04.034zbMath1253.90114OpenAlexW2117332871MaRDI QIDQ1926908
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/35658
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (21)
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems ⋮ Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
Cites Work
- Unnamed Item
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- 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 iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Shifting representation search for hybrid flexible flowline problems
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Iterated local search for the quadratic assignment problem
- 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
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: Local search methods for the flowshop scheduling problem with flowtime minimization
