Complexity of a scheduling problem with controllable processing times

Published 2009 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Complexity of a scheduling problem with controllable processing times
Authors
Keywords
-
Journal
OPERATIONS RESEARCH LETTERS
Volume 38, Issue 2, Pages 123-126
Publisher
Elsevier BV
Online
2009-10-25
DOI
10.1016/j.orl.2009.10.011

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More
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.