Scheduling open shops with parallel machines to minimize total completion time

DOI10.1016/J.CAM.2010.08.013MaRDI QIDQ609214zbMATH OpenOpenAlexFDO

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

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

mathematical modelschedulingmixed integer linear programmingTaguchi methodparallel machinesopen shopmemetic algorithm

Mathematics Subject Classification ID

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

Recommendations

• A study on open shop scheduling to minimise total tardiness
• Open shop scheduling with makespan and total completion time criteria
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• A new heuristic for open shop total completion time problem

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• A memetic algorithm for the flexible flow line scheduling problem with processor blocking
• A new particle swarm optimization for the open shop scheduling problem
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Algorithms for Solving Production-Scheduling Problems
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Comparative evaluation of MILP flowshop models
• Linear time approximation scheme for the multiprocessor open shop problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling flexible flow lines with sequence-dependent setup times
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics

Cited in

(15)

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• A tabu search approach for proportionate multiprocessor open shop scheduling
• 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
• A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
• Hybrid flexible flowshop problems: models and solution methods
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
• Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem
• The third comprehensive survey on scheduling problems with setup times/costs
• Two-machine open shop problem with a single server and set-up time considerations
• Flexible open shop scheduling problem to minimize makespan
• A single-machine bi-criterion scheduling problem with two agents
• Open shop scheduling with makespan and total completion time criteria
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
• Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops

Describes a project that uses

Uses Software

• Genocop

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

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