An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times
Authors
Keywords
Unrelated parallel batch machines, Total flow time, Scheduling, Iterated greedy, Local search heuristics, Meta-heuristics
Journal
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
Volume 77, Issue -, Pages 239-254
Publisher
Elsevier BV
Online
2018-11-03
DOI
10.1016/j.engappai.2018.10.012

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

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.