The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient. heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.
โฆ LIBER โฆ
Scheduling jobs to improve weighted on-time performance of a single machine
- Publisher
- Society of Manufacturing Engineers
- Year
- 2004
- Tongue
- English
- Weight
- 115 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0278-6125
No coin nor oath required. For personal study only.
โฆ Synopsis
2003-2004 abstract and ke cword index
specifically identify M. parafortuitum among a mixed microbial community in MWE It is also shown that the M. parafortuitum labeling methods are insensitive to the synthetic, semi-synthetic, and soluble oil MWF chemistries investigated. In addition, the use of FCM for quantification of M. parafortuitum is demonstrated, and important considerations for applying FCM in the field are described.
This paper is an original work and has not been previously published except in the Transactions of NAMRI/
๐ SIMILAR VOLUMES
Maximizing the weighted number of on-tim
โ
C. Koulamas
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 541 KB
Scheduling stochastic jobs on a single m
โ
K. D. Glazebrook
๐
Article
๐
1984
๐
John Wiley and Sons
๐
English
โ 745 KB
Single-machine scheduling to minimize th
โ
Chung-Lun Li; T.C.E. Cheng; Z.-L. Chen
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 866 KB
Scheduling jobs with release times preem
โ
Nodari Vakhania
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 910 KB
A note on single-machine scheduling with
โ
Ji-Bo Wang
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 175 KB
Schedule of n jobs on two identical mach
โ
Bahram Alidaee
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 209 KB