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

Scheduling with multi-attribute setup times on two identical parallel machines

โœ Scribed by Lee, Cheng-Hsiung; Liao, Ching-Jong; Chung, Tsui-Ping


Book ID
124090623
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
362 KB
Volume
153
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling with multi-attribute setup ti
โœ Cheng-Hsiung Lee; Ching-Jong Liao; Chien-Wen Chao ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB
Scheduling jobs on parallel machines wit
โœ Young Hoon Lee; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 855 KB

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the

Scheduling parallel machines with major
โœ Wittrock, RobertJ. ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 706 KB

This article discusses the problem of scheduling a large set of parts on an FMS so as to minimize the total completion time. Here, the FMS consists of a set of parallel identical machines. Setup time is incurred whenever a machine switches from one type of part to another. The setup time may be larg

Scheduling identical jobs on uniform par
โœ Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 261 KB

For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.