Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm
An important element in the integration of the fourth industrial revolution is the development of efficient algorithms to deal with dynamic scheduling problems. In dynamic scheduling, jobs can be admitted during the execution of a given schedule, which necessitates appropriately planned rescheduling...
Main Author: | Tamer F. Abdelmaguid |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/3/74 |
Similar Items
-
Scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
by: Javad Rezaeian, et al.
Published: (2013-09-01) -
ADAPTIVE, MULTI-OBJECTIVE JOB SHOP SCHEDULING USING GENETIC ALGORITHMS
by: Metta, Haritha
Published: (2008) -
Promoting Green and Sustainability: A Multi-Objective Optimization Method for the Job-Shop Scheduling Problem
by: Wenzhu Liao, et al.
Published: (2018-11-01) -
Study on multi-objective flexible job-shop scheduling problem considering energy consumption
by: Zengqiang Jiang, et al.
Published: (2014-06-01) -
JOB SHOP SCHEDULING BIOBJETIVO MEDIANTE ENFRIAMIENTO SIMULADO Y ENFOQUE DE PARETO JOB-SHOP SCHEDULING: BIO-OBJECTIVE THROUGH SIMULATED COOLING AND PARETO PRINCIPLE
by: Juan Carlos Osorio, et al.
Published: (2012-12-01)