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

Neural network applications for scheduling jobs on parallel machines

โœ Scribed by Young-Hoon Lee; Sooyoung Kim


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
251 KB
Volume
25
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Scheduling jobs and maintenance activiti
โœ Chung-Yee Lee; Zhi-Long Chen ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB ๐Ÿ‘ 1 views

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machin

Neural networks for job-shop scheduling
โœ T.M. Willems; J.E. Rooda ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 831 KB
Exact algorithms for scheduling multiple
โœ Zhi-Long Chen; Warren B. Powell ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o

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