Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Title
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
Authors
Keywords
-
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 35, Issue 4, Pages 1227-1249
Publisher
Elsevier BV
Online
2006-09-19
DOI
10.1016/j.cor.2006.07.013

Ask authors/readers for more resources

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

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started