Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms

Published 2017 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
Authors
Keywords
Distributed no-wait flow shop scheduling problem, Makespan, Iterated greedy algorithm, Neighborhood structures, Local search
Journal
KNOWLEDGE-BASED SYSTEMS
Volume 137, Issue -, Pages 163-181
Publisher
Elsevier BV
Online
2017-09-21
DOI
10.1016/j.knosys.2017.09.026

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

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

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.