A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops
Authors
Keywords
Flowshop problem, Scheduling, Tardiness, Iterated greedy algorithm, Random search
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 98, Issue -, Pages 300-307
Publisher
Elsevier BV
Online
2016-06-12
DOI
10.1016/j.cie.2016.06.012

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.