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

DOI10.3233/AIC-140630MaRDI QIDQ4589102zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Depth-first heuristic search for the job shop scheduling problem
• A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
• Problem and Heuristic Space Search Strategies for Job Shop Scheduling
• scientific article; zbMATH DE number 773975
• A Novel Heuristic Approach for Job Shop Scheduling Problem
• scientific article; zbMATH DE number 1982190
• Solving the job-shop scheduling problem optimally by dynamic programming
• An integrated search heuristic for large-scale flexible job shop scheduling problems

Cited in

(1)

• Depth-first heuristic search for the job shop scheduling problem

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

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