Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems

Multi-objective optimisation problems have seen a large impulse in the last decades. Many new techniques for solving distinct variants of multi-objective problems have been proposed. Production scheduling, as with other operations management fields, is no different. The flowshop problem is among the...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 38; no. 11; pp. 1521 - 1533
Main Authors:	Minella, Gerardo, Ruiz, Rubén, Ciavotta, Michele
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier Ltd 01.11.2011 Elsevier Pergamon Press Inc
Subjects:	Algorithms Applied sciences Decision theory. Utility theory Exact sciences and technology Flowshop Greedy algorithms Inventory control, production control. Distribution Iterated Greedy Iterative methods Job shops Mathematical problems Multi-objective Operational research and scientific management Operational research. Management science Operations management Operations research Optimization algorithms Pareto optimality Pareto optimum Permutations Production scheduling Scheduling Scheduling, sequencing Searching State of the art Studies Iterated Greedy Scheduling Flowshop Multi-objective Local search Population management Pareto optimum Permutation Empirical method Multiobjective programming Makespan Delay Production management Statistical test Greedy algorithm Flow shop Impulse
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!