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

DOI10.1007/S10589-007-9018-ZMaRDI QIDQ2643628zbMATH OpenOpenAlexFDO

Authors Gaofeng Huang, Andrew Lim, Brian Rodrigues

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

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

Recommendations

• Improving local search heuristics for some scheduling problems. I
• Improving local search heuristics for some scheduling problems. II
• scientific article; zbMATH DE number 1082109
• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
• Local search algorithms for the multiprocessor flow shop scheduling problem

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Genetic algorithms for the two-stage bicriteria flowshop problem
• Local search heuristics for two-stage flow shop problems with secondary criterion
• Optimal two- and three-stage production schedules with set-up time included
• Two-Stage Flowshop Scheduling Problem with Bicriteria

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

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