Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence

Title
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
Authors
Keywords
-
Journal
Discrete Optimization
Volume 9, Issue 1, Pages 29-39
Publisher
Elsevier BV
Online
2011-12-09
DOI
10.1016/j.disopt.2011.11.001

Ask authors/readers for more resources

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

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