A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach

2021 ◽  
Vol 132 ◽  
pp. 105319
Author(s):  
Ahmed KOUIDER ◽  
Hacène AIT HADDADÈNE
Keyword(s):  
Branch And Bound ◽  
Graph Coloring ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Branch And Bound Algorithm ◽  
Mixed Graph ◽  
Shop Scheduling

Using mixed graph coloring to minimize total completion time in job shop scheduling

2006 ◽  
Vol 182 (2) ◽  
pp. 1137-1148 ◽  
Author(s):  
Fawaz S. Al-Anzi ◽  
Yuri N. Sotskov ◽  
Ali Allahverdi ◽  
George V. Andreev
Keyword(s):  
Graph Coloring ◽  
Completion Time ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Total Completion Time ◽  
Mixed Graph ◽  
Shop Scheduling

scholarly journals Unit-Time Job-Shop Scheduling by Algorithm for Mixed Graph Coloring (Invited paper)

2000 ◽  
Vol 33 (17) ◽  
pp. 681-686
Author(s):  
Yuri N. Sotsko ◽  
Alexandre B. Dolgu ◽  
Georgi V. Andreev
Keyword(s):  
Graph Coloring ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Mixed Graph ◽  
Shop Scheduling

scholarly journals Job Shop Scheduling by Branch and Bound Using Genetic Programming

2019 ◽  
Vol 39 ◽  
pp. 1112-1118
Author(s):  
Katsumi Morikawa ◽  
Keisuke Nagasawa ◽  
Katsuhiko Takahashi
Keyword(s):  
Genetic Programming ◽  
Branch And Bound ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document