Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

Open Shop Scheduling Problem (OSSP) is one of the most important scheduling problems in the field of engineering and industry. This kind of problem includes m machines and n jobs, each job contains a certain number of operations, and each operation has a predetermined processing time on its correspo...

Full description

Saved in:
Bibliographic Details
Main Authors: Seyed Hassan Shams Lahroudi, Farzaneh Mahalleh, Seyedsaeid Mirkamali
Format: Article
Language:English
Published: Wiley 2022-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2022/5043058
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items