Unrelated parallel machine scheduling with new criteria: Complexity and models

Title
Unrelated parallel machine scheduling with new criteria: Complexity and models
Authors
Keywords
Scheduling, Unrelated parallel machines, Sequence-dependent setup times, Auxiliary resources, Complexity, Integer linear programming
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 132, Issue -, Pages 105291
Publisher
Elsevier BV
Online
2021-04-14
DOI
10.1016/j.cor.2021.105291

Ask authors/readers for more resources

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now