1. Home
  2. Premium
  3. A New Bi-Objective Batch Scheduling Problem: NSGA-II-and-Local-Search-Based Memetic Algorithms
A New Bi-Objective Batch Scheduling Problem: NSGA-II-and-Local-Search-Based Memetic Algorithms

This video program is a part of the Premium package:

A New Bi-Objective Batch Scheduling Problem: NSGA-II-and-Local-Search-Based Memetic Algorithms

  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

A New Bi-Objective Batch Scheduling Problem: NSGA-II-and-Local-Search-Based Memetic Algorithms

0 views
  • Share

Next Up

00:30:20
IEEE Standards Association – A New Era: Raising the World’s Standards
>
00:49:13
Entrepreneurship and Innovation in Robotics
>
00:08:06
Siwei Li - RFIC Student Showcase - IMS 2021
>
00:03:49
Gaofeng Jin - RFIC Student Showcase - IMS 2021
>
00:03:57
Shimin Huang - RFIC Student Showcase - IMS 2021
>
00:04:15
Xinyan Tang - RFIC Student Showcase - IMS 2021
>