Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
Authors
Keywords
Robust optimization, Scheduling, Uncertainty, Computational complexity
Journal
OPERATIONS RESEARCH LETTERS
Volume 44, Issue 3, Pages 354-358
Publisher
Elsevier BV
Online
2016-03-17
DOI
10.1016/j.orl.2016.03.005

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

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.