scientific article; zbMATH DE number 1982190

MaRDI QIDQ4426359zbMATH OpenFDO

Authors Marco Pranzo, C. Meloni, Dario Pacciarelli

Publication date 16 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2647/26470223.htm

Mathematics Subject Classification ID

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

Recommendations

• A grasp for job shop scheduling
• A greedy open shop heuristic with job priorities
• Heuristics for short route job shop scheduling problems
• A fuzzy greedy heuristic for permutation flow-shop scheduling
• A new heuristic for the n-job, M-machine flow-shop problem

Cited in

(10)

• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• Dispatching and coordination in multi-area railway traffic management
• scientific article; zbMATH DE number 5117521 (Why is no real title available?)
• Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Problem and Heuristic Space Search Strategies for Job Shop Scheduling
• Set covering heuristics in a benders decomposition for railway timetabling
• Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
• A job shop scheduling heuristic for varying reward structures

This page was built for publication:

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