New MIP model for Multiprocessor Scheduling Problem with Communication Delays

Author(s):  
Abdessamad Ait El Cadi ◽  
Mustapha Ratli ◽  
Nenad Mladenović
2014 ◽  
Vol 11 (6) ◽  
pp. 1091-1107 ◽  
Author(s):  
Abdessamad Ait El Cadi ◽  
Rabie Ben Atitallah ◽  
Saïd Hanafi ◽  
Nenad Mladenović ◽  
Abdelhakim Artiba

2001 ◽  
Vol 29 (5) ◽  
pp. 241-245 ◽  
Author(s):  
Han Hoogeveen ◽  
Gerhard J. Woeginger

1997 ◽  
Vol 45 (1) ◽  
pp. 145-147 ◽  
Author(s):  
Alix Munier ◽  
Jean-Claude König

2013 ◽  
Vol 791-793 ◽  
pp. 1520-1524
Author(s):  
Peng Gao ◽  
Yue Jin Tan

This paper transfer the area target scheduling problem into maximal coverage problem based on summaring the traditional sovling problem. A MIP model is build based on problem characters; simulated anneanling problem is used to solve the problem. Four neighborhood and tow differentiation mechanisms are designed to fit the study problem, such as offset neighborhood. The relationship between coverage and overlap and division angle is analysised by test data, and algorithm validation and effective is test based on example data.


1992 ◽  
Vol 23 (13) ◽  
pp. 54-65 ◽  
Author(s):  
Hironori Kasahara ◽  
Atsusi Itoh ◽  
Hisamitsu Tanaka ◽  
Keisuke Itoh

Sign in / Sign up

Export Citation Format

Share Document