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

An efficient job scheduling algorithm for mixed turnaround and deadline applications

โœ Scribed by K.Sundar Das; Toby J. Teorey

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
715 KB
Volume
16
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient memetic algorithm for solvi
An efficient memetic algorithm for solving the job shop scheduling problem
โœ Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 741 KB

## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff

Genetic algorithms for the job-shop sche
Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedence
โœ Fatima Ghedjati ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

In this paper, we are interested in job-shop scheduling problems with several unrelated parallel machines and precedence constraints between the operations of the jobs (with either linear or non-linear process routings). The objective is to minimize the maximum completion time (Cmax). We propose an