A local search using solution fragments for the 2-machine bicriteria scheduling problem

DOI10.1007/s10589-007-9018-zzbMath1181.90118OpenAlexW2020335395MaRDI QIDQ2643628

Andrew E. B. Lim, Brian Rodrigues, Gaofeng Huang

Publication date: 27 August 2007

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9018-z

zbMATH Keywords

Local searchBicriteria flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Genetic algorithms for the two-stage bicriteria flowshop problem
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• Local search heuristics for two-stage flow shop problems with secondary criterion

This page was built for publication: A local search using solution fragments for the 2-machine bicriteria scheduling problem