scientific article

zbMath1182.68058arXiv1110.2743MaRDI QIDQ3624067

J. Christopher Beck

Publication date: 28 April 2009

Full work available at URL: https://arxiv.org/abs/1110.2743

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tabu search algorithmlimited discrepancy searchchronological backtrackingrandomized restart

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Underground mine scheduling of mobile machines using constraint programming and large neighborhood search ⋮ The Relation Between Complete and Incomplete Search ⋮ A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem ⋮ Bounding, filtering and diversification in CP-based local branching ⋮ A competent memetic algorithm for complex scheduling ⋮ Solution counting algorithms for constraint-centered search heuristics

This page was built for publication: