Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time

Published 2013 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
Authors
Keywords
-
Journal
INFORMATION SCIENCES
Volume 251, Issue -, Pages 150-163
Publisher
Elsevier BV
Online
2013-07-16
DOI
10.1016/j.ins.2013.07.003

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

Create your own webinar

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

Create Now
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.