A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems

DOI10.1057/PALGRAVE.JORS.2600373zbMath0890.90086OpenAlexW1983595842MaRDI QIDQ4367014

Rasaratnam Logendran, A. Sonthinen

Publication date: 6 July 1998

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600373

zbMATH Keywords

job-shop type flexible manufacturing systemtabu search-based heuristics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30)

Related Items (8)

An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ Coordinated optimization of production scheduling and maintenance activities with machine reliability deterioration ⋮ A mathematical programming-based scheduling framework for multitasking environments ⋮ Group-scheduling problems in electronics manufacturing ⋮ A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: threshold-based alternate routing ⋮ Scheduling flexible manufacturing cells using Tabu Search ⋮ The crop growth planning problem in vertical farming ⋮ Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

This page was built for publication: A Tabu search-based approach for scheduling job-shop type flexible manufacturing systems