Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm

DOI10.1016/J.AMC.2014.06.019zbMath1335.90041OpenAlexW2042318329WikidataQ115102438 ScholiaQ115102438MaRDI QIDQ279989

Yuping Wang, Ren Qing-dao-er-ji

Publication date: 29 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.06.019

zbMATH Keywords

local searchgenetic algorithmcrossover operatormulti-objective flow shop schedulingmutation operator

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Cites Work

• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• An exact parallel method for a bi-objective permutation flowshop problem
• A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• A genetic algorithm for flowshop sequencing
• A new hybrid genetic algorithm for job shop scheduling problem
• A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Applying tabu search to the job-shop scheduling problem
• A bicriteria scheduling with sequence-dependent setup times
• Optimal two- and three-stage production schedules with setup times included
• Service Time Optimization of Mixed-Line Flow Shop Systems

This page was built for publication: Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm