A lower bound for minimizing the total completion time of a three-agent scheduling problem
['Yau-Ren Shiau', 'Wen-Chiung Lee', 'Yu-Sheng Kung', 'Jen-Ya Wang']
/
Information Sciences
/ Vol. 340
0.0 / 5
0
Reviews
You must log in to post, edit and delete a review.
Log in
Earn 50 points when your review is published.
About KnowledgeRank Points
No reviews have been posted yet. Be the first to write one!