Solving multi-objective job shop problem using nature-based algorithms: new Pareto approximation features

DOI10.11121/IJOCTA.01.2015.00232MaRDI QIDQ2980949zbMATH OpenOpenAlexFDO

Authors Jarosław Rudy, Dominik Żelazny

Publication date 8 May 2017

Published in An International Journal of Optimization and Control: Theories & Applications (IJOCTA) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.11121/ijocta.01.2015.00232

zbMATH Keywords

multi-objective optimizationjob shop schedulingmulti-criteria decision analysisnature inspired

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
• A multi-objective memetic algorithm for the job-shop scheduling problem
• Genetic local search for multi-objective flowshop scheduling problems
• Two-stage hybrid Pareto ant colony algorithm for multi-objective flexible job shop scheduling

This page was built for publication: Solving multi-objective job shop problem using nature-based algorithms: new Pareto approximation features

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980949)