𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pareto archived simulated annealing for job shop scheduling with multiple objectives

✍ Scribed by R.K. Suresh; K.M. Mohanasundaram

Publisher
Springer
Year
2005
Tongue
English
Weight
291 KB
Volume
29
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Pareto simulated annealingβ€”a metaheurist
Pareto simulated annealingβ€”a metaheuristic technique for multiple-objective combinatorial optimization
✍ Piotr CzyzΕΌak; Adrezej Jaszkiewicz πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 377 KB πŸ‘ 2 views

This paper presents a multiple-objective metaheuristic procedureÐPareto simulated annealing. The goal of the procedure is to find in a relatively short time a good approximation of the set of efficient solutions of a multipleobjective combinatorial optimization problem. The procedure uses a sample,

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