A contribution and new heuristics for open shop scheduling

DOI10.1016/J.COR.2009.04.010MaRDI QIDQ733548zbMATHOpenAlexFDO

Authors S. M. T. Fatemi Ghomi, Bahman Naderi, Majid Aminnayeri, Mostafa Zandieh

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

permutationschedulingredundancyopen shopconstructive heuristicencoding schemeinsertion and reinsertion operators

Mathematics Subject Classification ID

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

Recommendations

• New efficient heuristics for scheduling open shops with makespan minimization
• A new heuristic for open shop total completion time problem
• Classical and new heuristics for the open-shop problem: A computational evaluation
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• A heuristic algorithm for open-shop scheduling problems with a single server
• Constructive heuristic algorithms for the open shop problem
• The open shop scheduling problem
• A Note On The Complexity Of Openshop Scheduling Problems
• Solving the open shop scheduling problem
• scientific article; zbMATH DE number 4068593

Cites work

• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 5241907 (Why is no real title available?)
• A branch \(\&\) bound algorithm for the open-shop problem
• A hybrid genetic algorithm for the open shop scheduling problem
• A new lower bound for the open-shop problem
• A new particle swarm optimization for the open shop scheduling problem
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• Benchmarks for basic scheduling problems
• Classical and new heuristics for the open-shop problem: A computational evaluation
• Competitive genetic algorithms for the open-shop scheduling problem
• Constructive heuristic algorithms for the open shop problem
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• Scheduling job shop problems with sequence-dependent setup times
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• Solving the open shop scheduling problem

Cited in

(13)

• A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
• New efficient heuristics for scheduling open shops with makespan minimization
• Scheduling in manufacturing with transportation: classification and solution techniques
• Retracted article: Multi-objective open shop scheduling by considering human error and preventive maintenance
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Aggregation heuristic for the open-pit block scheduling problem
• scientific article; zbMATH DE number 4068593 (Why is no real title available?)
• Large-scale medical examination scheduling technology based on intelligent optimization
• A study on open shop scheduling to minimise total tardiness
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
• The representation of partially-concurrent open shop problems
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
• A genetic algorithm for scheduling open shops with sequence-dependent setup times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733548)