Scheduling open shops with parallel machines to minimize total completion time

DOI10.1016/j.cam.2010.08.013zbMath1200.90083OpenAlexW2039632218MaRDI QIDQ609214

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

Publication date: 30 November 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.08.013

zbMATH Keywords

Taguchi methodschedulingparallel machinesopen shopmathematical modelmixed integer linear programmingmemetic algorithm

Mathematics Subject Classification ID

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

Related Items (12)

Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ Two-machine open shop problem with a single server and set-up time considerations ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ Large-scale medical examination scheduling technology based on intelligent optimization ⋮ A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities ⋮ Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem ⋮ A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• A memetic algorithm for the flexible flow line scheduling problem with processor blocking
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Scheduling flexible flow lines with sequence-dependent setup times
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• A new particle swarm optimization for the open shop scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Comparative evaluation of MILP flowshop models
• Algorithms for Solving Production-Scheduling Problems
• Linear time approximation scheme for the multiprocessor open shop problem

This page was built for publication: Scheduling open shops with parallel machines to minimize total completion time