Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem

Published 2015 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem
Authors
Keywords
Scheduling, Flow-shop, Matheuristic, Genetic algorithm
Journal
JOURNAL OF INTELLIGENT MANUFACTURING
Volume 29, Issue 3, Pages 617-628
Publisher
Springer Nature
Online
2015-02-04
DOI
10.1007/s10845-015-1046-4
References
View 2 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

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.