๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Single machine scheduling problem with interval processing times to minimize mean weighted completion time

โœ Scribed by Allahverdi, Ali; Aydilek, Harun; Aydilek, Asiye


Book ID
125799684
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
595 KB
Volume
51
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling of a single machine to minimi
โœ Lucio Bianco; Salvatore Ricciardelli ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 764 KB

## Abstract In this paper the __n__/1/__r__~j~ ฮฃ~j~ __w__~__j__~ __C__~__j__~ problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are