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

Helper-objective optimization strategies for the Job-Shop Scheduling Problem

โœ Scribed by Darrell F. Lochtefeld; Frank W. Ciarallo

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
451 KB
Volume
11
Category
Article
ISSN
1568-4946

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

An agent-based parallel approach for the
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
โœ Leila Asadzadeh; Kamran Zamanifar ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s

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