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

Flexible job-shop scheduling problem by genetic algorithm

โœ Scribed by Kenichi Ida; Kensaku Oka

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
361 KB
Volume
177
Category
Article
ISSN
0424-7760

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Effective neighbourhood functions for th
Effective neighbourhood functions for the flexible job shop problem
โœ Monaldo Mastrolilli; Luca Maria Gambardella ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English โš– 173 KB

The exible job shop problem is an extension of the classical job shop scheduling problem which allows an operation to be performed by one machine out of a set of machines. The problem is to assign each operation to a machine (routing problem) and to order the operations on the machines (sequencing p

Approximation algorithms for shop schedu
Approximation algorithms for shop scheduling problems with minsum objective
โœ Maurice Queyranne; Maxim Sviridenko ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We