Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances

Title
Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances
Authors
Keywords
-
Journal
ENGINEERING OPTIMIZATION
Volume 48, Issue 1, Pages 173-183
Publisher
Informa UK Limited
Online
2015-01-30
DOI
10.1080/0305215x.2015.1005083

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

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now