Solution Representation in Proportionate Multiprocessor Open Shop
نویسندگان
چکیده
منابع مشابه
A tabu search approach for proportionate multiprocessor open shop scheduling
In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing centers -each having one or more parallel identical machines, while jobs do not have a pre-specified obligatory route. A special case is the proportionate multiprocessor open shop scheduling problem (PMOSP) in which the processing time on a given center is not job-dependent. Applications of the P...
متن کاملProportionate flow shop games
In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines. By identifying jobs with agents whose costs linearly depend on the completion time of their jobs and assuming an initial processing order on the jobs, we face two problems: the first is how to obtain an optimal order that minim...
متن کاملApproximation algorithms for the multiprocessor open shop scheduling problem
We investigate the multiprocessor multi stage open shop scheduling problem In this variant of the open shop model there are s stages each consisting of a number of parallel identical machines Each job consists of s operations one for each stage that can be executed in any order The goal is to nd a non preemptive schedule that minimizes the makespan We derive two approximation results for this N...
متن کاملSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Ant colony optimisation, a constructive metaheuristic inspired by the foraging behaviour of ants, has been applied to a wide range of problems since its inception. Many of these are production scheduling problems such as the job shop, in which a collection of operations (grouped into jobs) must be scheduled for processing on different machines. In typical ACO applications, solutions are generat...
متن کاملPartially-Concurrent Open Shop Scheduling
The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by allowing some operations to be processed concurrently. This generalization is directly motivated from a real-life timetabling project of assigning technicians to airplanes in an airplane garage. A schedule for the partially-concurrent problem is represented by a digrap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Systems: Theory and Applications
سال: 2021
ISSN: 2651-3927
DOI: 10.38016/jista.852099