Algorithms for bicriteria minimization in the permutation flow shop scheduling problem

DOI10.3934/jimo.2011.7.253zbMath1214.90056OpenAlexW2313934637MaRDI QIDQ542590

Ethel Mokotoff

Publication date: 10 June 2011

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2011.7.253

zbMATH Keywords

heuristicsmulti-objective optimizationmanagement decision makingflow-shopdeterministic scheduling theory

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking

This page was built for publication: Algorithms for bicriteria minimization in the permutation flow shop scheduling problem