A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES

Published 2014 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES
Authors
Keywords
-
Journal
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
Volume 31, Issue 04, Pages 1450030
Publisher
World Scientific Pub Co Pte Lt
Online
2014-06-03
DOI
10.1142/s0217595914500304
References
View 2 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.