Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem
JOURNAL OF MATHEMATICAL MODELLING AND ALGORITHMS ; 9 , 1 ; 39-51
2010-01-01
13 pages
Article (Journal)
English
DDC: | 003.3 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Segmentation-Based Nonpreemptive Channel Scheduling Algorithms for Optical Burst-Switched Networks
British Library Online Contents | 2005
|British Library Online Contents | 1999
|British Library Conference Proceedings | 2012
|BicriteriaHeuristic for Unrelated Parallel Machine Scheduling Problem
British Library Conference Proceedings | 2014
|ArXiv | 2015
|