Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
Authors
Keywords
Identical machines, Delivery coordination, Assignable delivery times, Approximation algorithm, Polynomial-time approximation scheme
Journal
THEORETICAL COMPUTER SCIENCE
Volume 622, Issue -, Pages 45-65
Publisher
Elsevier BV
Online
2016-02-03
DOI
10.1016/j.tcs.2016.01.044

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

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation
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.