z-logo
open-access-imgOpen Access
Climbing Depth-bounded Discrepancy Search for Solving Flexible Job Shop Scheduling Problems
Author(s) -
Abir Ben Hmida,
MarieJosé Huguet,
Pierre Lòpez,
Mohamed Haouari
Publication year - 2007
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - job shop scheduling , computer science , mathematical optimization , flow shop scheduling , scheduling (production processes) , job shop , schedule , rate monotonic scheduling , hill climbing , bounded function , fair share scheduling , artificial intelligence , mathematics , operating system , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom