Problem difficulty for tabu search in job-shop scheduling

, , &
Artificial Intelligence 143 (2):189-217 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(02)00363-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem.Norman Sadeh & Mark S. Fox - 1996 - Artificial Intelligence 86 (1):1-41.
A modified biogeography-based optimization algorithm with improved mutation operator for job shop scheduling problem with time lags.Madiha Harrabi, Olfa Belkahla Driss & Khaled Ghedira - forthcoming - Logic Journal of the IGPL.
A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem.Pisut Pongchairerks - 2019 - Complexity 2019:1-11.
An improved tabu search algorithm for 3D protein folding problem.Xiaolong Zhang & Wen Cheng - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), PRICAI 2008: Trends in Artificial Intelligence. Springer. pp. 1104--1109.
生得分離モデルを用いた Ga と Jsp への適用.Kobayashi Sigenobu Ikeda Kokolo - 2002 - Transactions of the Japanese Society for Artificial Intelligence 17:530-538.
A multi-objective mathematical model and genetic algorithm for reliability analysis in flexible job-shop scheduling problem.Paria Fouladi & Aydin Aghajani - 2018 - International Journal of Management Concepts and Philosophy 11 (2):219.
Job Shop Scheduling Based on Digital Twin Technology: A Survey and an Intelligent Platform.Haifei Yu, Songjian Han, Dongsheng Yang, Zhiyong Wang & Wei Feng - 2021 - Complexity 2021:1-12.
Local Search for Planning and Scheduling, volume 2148 of.A. Nareyek - 2001 - In P. Bouquet (ed.), Lecture Notes in Artificial Intelligence. Kluwer Academic Publishers.
Constraint propagation techniques for the disjunctive scheduling problem.Ulrich Dorndorf, Erwin Pesch & Toàn Phan-Huy - 2000 - Artificial Intelligence 122 (1-2):189-240.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,268,194)

6 months
6 (#701,126)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Easy problems are sometimes hard.Ian P. Gent & Toby Walsh - 1994 - Artificial Intelligence 70 (1-2):335-345.

Add more references