Author/Creator: Jarboui, Bassem - British Library Electronic Legal Deposit Catalogue-Journal Issues and Articles Search Results

Author/Creator Jarboui, Bassem

1. A general variable neighborhood search for the swap-body vehicle routing problem. (February 2017)

Authors:: Todosijević, Raca; Hanafi, Saïd; Urošević, Dragan; Jarboui, Bassem; Gendron, Bernard
Journal:: Computers & operations research
Issue:: Volume 78(2017)
Page Start:: 468
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

2. An integration of mixed VND and VNS: the case of the multivehicle covering tour problem. (17th October 2016)

Authors:: Kammoun, Manel; Derbel, Houda; Ratli, Mostapha; Jarboui, Bassem
Journal:: International transactions in operational research
Issue:: Volume 24:Number 3(2017)
Page Start:: 663
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

3. Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria. (2017)

Authors:: Toumi, SaÁ¯d; Jarboui, Bassem; Eddaly, Mansour; RebaÁ¯, Abdelwaheb
Journal:: International journal of operational research
Issue:: Volume 30:Number 4(2017)
Page Start:: 441
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

4. Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. (2017)

Authors:: Toumi, Saïd; Jarboui, Bassem; Eddaly, Mansour; Rebaï, Abdelwaheb
Journal:: International journal of mathematics in operational research
Issue:: Volume 10:Number 1(2017)
Page Start:: 34
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

5. Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. (2017)

Authors:: Toumi, SaÁ¯d; Jarboui, Bassem; Eddaly, Mansour; RebaÁ¯, Abdelwaheb
Journal:: International journal of mathematics in operational research
Issue:: Volume 10:Number 1(2017)
Page Start:: 34
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

6. Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. Issue 4 (17th May 2016)

Authors:: Eddaly, Mansour; Jarboui, Bassem; Siarry, Patrick
Journal:: Journal of computational design and engineering
Issue:: Volume 3:Issue 4(2016)
Page Start:: 295
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

7. Efficient matheuristic for the generalised multiple knapsack problem with setup. (18th September 2020)

Authors:: Adouani, Yassine; Jarboui, Bassem; Masmoudi, Malek
Journal:: European journal of industrial engineering
Issue:: Volume 14:Number 5(2020)
Page Start:: 715
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

8. How to Use K-means for Big Data Clustering?. (May 2023)

Authors:: Mussabayev, Rustam; Mladenovic, Nenad; Jarboui, Bassem; Mussabayev, Ravil
Journal:: Pattern recognition
Issue:: Volume 137(2023)
Page Start:
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

9. Improved memetic programming algorithm. (4th July 2022)

Authors:: Elleuch, Souhir; Jarboui, Bassem
Journal:: International journal of operational research
Issue:: Volume 44:Number 3(2022)
Page Start:: 389
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗

10. Mixed integer linear programming formulations for the permutation flow shop scheduling problem with preventive maintenance activities. (6th June 2023)

Authors:: Jomaa, Wahiba; Eddaly, Mansour; Jarboui, Bassem
Journal:: International journal of mathematics in operational research
Issue:: Volume 25:Number 2(2023)
Page Start:: 139
Record Type:: Journal Article
View Content:: Available online (eLD content is only available in our Reading Rooms) ↗