Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost

Title
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
Authors
Keywords
-
Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 332, Issue -, Pages 1-18
Publisher
Elsevier BV
Online
2018-03-28
DOI
10.1016/j.amc.2018.03.001

Ask authors/readers for more resources

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

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