A contribution and new heuristics for open shop scheduling

DOI10.1016/j.cor.2009.04.010zbMath1171.90403OpenAlexW2001808054MaRDI QIDQ733548

Seyyed Mohammad Taghi Fatemi Ghomi, Bahman Naderi, Mostafa Zandieh, Majid Amin-Nayeri

Publication date: 16 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.010

zbMATH Keywords

schedulingpermutationopen shopredundancyconstructive heuristicencoding schemeinsertion and reinsertion operators

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

New efficient heuristics for scheduling open shops with makespan minimization ⋮ The representation of partially-concurrent open shop problems ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A study on open shop scheduling to minimise total tardiness ⋮ Large-scale medical examination scheduling technology based on intelligent optimization ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop ⋮ Multi-objective open shop scheduling by considering human error and preventive maintenance ⋮ A genetic algorithm for scheduling open shops with sequence-dependent setup times

Cites Work

• Classical and new heuristics for the open-shop problem: A computational evaluation
• Constructive heuristic algorithms for the open shop problem
• A branch \(\&\) bound algorithm for the open-shop problem
• Competitive genetic algorithms for the open-shop scheduling problem
• A hybrid genetic algorithm for the open shop scheduling problem
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• A new lower bound for the open-shop problem
• Benchmarks for basic scheduling problems
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• A new particle swarm optimization for the open shop scheduling problem
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• Scheduling job shop problems with sequence-dependent setup times
• Solving the open shop scheduling problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A contribution and new heuristics for open shop scheduling