Imed Kacem Scheduling Flexible Job-Shops: A Worst Case Analysis And An Evolutionary Algorithm. [Citation Graph (0, 0)][DBLP] International Journal of Computational Intelligence and Applications, 2003, v:3, n:4, pp:437-452 [Journal]
Imed Kacem, Slim Hammadi, Pierre Borne Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Systems, Man, and Cybernetics, Part C, 2002, v:32, n:1, pp:1-13 [Journal]
Imed Kacem, Slim Hammadi, Pierre Borne Correction to "approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems". [Citation Graph (0, 0)][DBLP] IEEE Transactions on Systems, Man, and Cybernetics, Part C, 2002, v:32, n:2, pp:172- [Journal]
Approximation algorithms for single machine scheduling with one unavailability period. [Citation Graph (, )][DBLP]
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. [Citation Graph (, )][DBLP]
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. [Citation Graph (, )][DBLP]
Search in 0.012secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP