A branch-and-bound algorithm for minimizing the total...

  • Main
  • 2016 / 5
  • A branch-and-bound algorithm for minimizing the total...
Knowledge-Based Systems 2016 / 5

A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents

Lee, Wen-Chiung, Wang, Jen-Ya, Lin, Mei-Chun
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Language:
english
Journal:
Knowledge-Based Systems
DOI:
10.1016/j.knosys.2016.05.012
Date:
May, 2016
File:
PDF, 1.03 MB
english, 2016
Conversion to is in progress
Conversion to is failed