A study on open shop scheduling to minimise total tardiness

DOI10.1080/00207543.2010.497174zbMath1356.90059OpenAlexW2028651280MaRDI QIDQ2967576

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

Publication date: 1 March 2017

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207543.2010.497174

zbMATH Keywords

Taguchi methodschedulingopen shopgenetic algorithmmathematical modelmixed integer linear programmingtotal tardinessvariable neighbourhood serach

Mathematics Subject Classification ID

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

Related Items (5)

New efficient heuristics for scheduling open shops with makespan minimization ⋮ Optimization for cooperative task planning of heterogeneous multi-robot systems in an order picking warehouse ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling

Cites Work

• Scheduling preemptive open shops to minimize total tardiness
• A contribution and new heuristics for open shop scheduling
• A branch \(\&\) bound algorithm for the open-shop problem
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Scheduling flexible flow lines with sequence-dependent setup times
• A new lower bound for the open-shop problem
• Benchmarks for basic scheduling problems
• A new particle swarm optimization for the open shop scheduling problem
• A study of integer programming formulations for scheduling problems
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
• A genetic algorithm for flexible job shop scheduling with fuzzy processing time
• An improved genetic algorithm for the flowshop scheduling problem
• New MILP models for the permutation flowshop problem
• Comparative evaluation of MILP flowshop models
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: A study on open shop scheduling to minimise total tardiness