Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms

Title
Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms
Authors
Keywords
-
Journal
APPLIED MATHEMATICAL MODELLING
Volume 33, Issue 4, Pages 2145-2158
Publisher
Elsevier BV
Online
2008-06-05
DOI
10.1016/j.apm.2008.05.019

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