Memetic algorithm for solving Flexible flow-shop scheduling problems with dynamic transport waiting times

Published 2019 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Memetic algorithm for solving Flexible flow-shop scheduling problems with dynamic transport waiting times
Authors
Keywords
Flexible flow-shop scheduling, Dynamic waiting times, Integrated scheduling, Iterated greedy algorithm, Makespan
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume -, Issue -, Pages -
Publisher
Elsevier BV
Online
2019-08-01
DOI
10.1016/j.cie.2019.07.041

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

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.