A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

Title
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Authors
Keywords
-
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 36, Issue 2, Pages 358-378
Publisher
Elsevier BV
Online
2007-10-12
DOI
10.1016/j.cor.2007.10.004

Ask authors/readers for more resources

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