A comparative representation approach to modern heuristic search methods in a job shop
نویسندگان
چکیده
منابع مشابه
A Comparative Representation Approach To Modern Heuristic Search Methods In A Job Shop
The job shop problem is among the class of NPhard combinatorial problems. This Research paper addresses the problem of static job shop scheduling on the job-based representation and the rule based representations. The popular search techniques like the genetic algorithm and simulated annealing are used for the determination of the objectives like minimizations of the makespan time and mean flow...
متن کاملA Heuristic Approach Based on Tabu Search for Early/Tardy Flexible Job Shop Problems
This paper addresses minimizing Total Weighted Earliness/Tardiness (TWET) of jobs in a Flexible Job Shop (FJS) problem. The FJS problem is an extension of the classical Job Shop (JS) problem that implies each operation may be assigned to alternative available machines. So, a job may have alternative routing. The FJS problem with a TWET criterion is modeled as a mixed integer programming. The mo...
متن کاملA New Approach in Job Shop Scheduling: Overlapping Operation
In this paper, a new approach to overlapping operations in job shop scheduling is presented. In many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. In each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...
متن کاملHeuristic Methods for Solving Job-Shop Scheduling Problems
Solving scheduling problems with Constraint Satisfaction Problems (CSP’s) techniques implies a wide space search with a large number of variables, each one of them with a wide interpretation domain. This paper discusses the application of CSP heuristic techniques (based on the concept of slack of activities) for variable and value ordering on a special type of job-shop scheduling problems in wh...
متن کاملFlow-shop Problems: A Heuristic Search Algorithm
This article presents an intelligent heuristic search algorithm (IHSA*) for solving flow-shop problems with two or three machines and an arbitrary number of jobs. Following its initial development the algorithm has been modified in two different ways in order to reduce backtracking and to improve its performance. The first modification concerns the choice of the best heuristic function to use, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Logistics Economics and Globalisation
سال: 2008
ISSN: 1741-5373,1741-5381
DOI: 10.1504/ijleg.2008.023170