Active Solution Space and Search on Job-shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
An Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملSolution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. A small number of these “elite” solutions is maintained during the search. We introduce the tech...
متن کاملA machine-order search space for job-shop scheduling problems
This paper proposes a methodology for real-time job-shop scheduling problems. It introduces a new classification of the scheduling methods for JSSPs with emphasis on the search methods and the significance of the search space. Subsequently, a machine-order search space is proposed as a new framework in which different single-machine scheduling algorithms and search methods can be incorporated t...
متن کاملGenetic Local Search for Job Shop Scheduling Problem
The Job Shop Scheduling Problem is a strongly NP-hard problem of combinatorial optimisation and one of the best-known machine scheduling problem. Taboo Search is an effective local search algorithm for the job shop scheduling problem, but the quality of the best solution found depends on the initial solution. To overcome this problem we present a new approach that uses a population of Taboo Sea...
متن کاملNew Tabu Search Results for the Job Shop Scheduling Problem
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2004
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss.124.1626