A genetic algorithm based procedure for more realistic job shop scheduling problems

DOI10.1080/002075498192148zbMath0946.90527OpenAlexW2038686560MaRDI QIDQ4245733

S. K. Khator, R. M. Barcia, M. A. B. Candido

Publication date: 8 June 1999

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

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

Mathematics Subject Classification ID

Production models (90B30)

Related Items

Genetic algorithms in supply chain management: a critical analysis of the literature ⋮ Augmented neural networks for task scheduling. ⋮ A branch and bound method for the job-shop problem with sequence-dependent setup times ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ A sequencing approach for creating new train timetables ⋮ A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: threshold-based alternate routing ⋮ A scatter search approach to sequence-dependent setup times job shop scheduling ⋮ Scheduling job shop associated with multiple routings with genetic and ant colony heuristics