Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules

DOI10.3233/AIC-140630zbMath1373.68381OpenAlexW1541994357MaRDI QIDQ4589102

Carlos Mencía, María R. Sierra, Miguel A. Salido, Joan Escamilla, Ramiro Varela

Publication date: 7 November 2017

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-140630

zbMATH Keywords

operatorsjob shop scheduling problemrestartsdepth first searchpruning by dominance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules