𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem

✍ Scribed by Masato Watanabe; Kenichi Ida; Mitsuo Gen

Book ID
108094610
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
245 KB
Volume
48
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A simulated annealing algorithm for the
A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts
✍ Atabak Elmi; Maghsud Solimanpur; Seyda Topaloglu; Afshin Elmi πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 444 KB

This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear