Solving flexible flow-shop problems by LPT and LN scheduling algorithms

DOI10.12988/IMF.2006.06032MaRDI QIDQ3517610zbMATH OpenOpenAlexFDO

Authors T. P. Hong, Gwoboa Horng, Peiying Huang, Chien-Lung Wang

Publication date 12 August 2008

Published in International Mathematical Forum (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b3332ea8f23140a7b8a865793606b9bbd85c2932

zbMATH Keywords

flexible flow shopLN schedulingLPT schedulingscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• scientific article; zbMATH DE number 1998826
• scientific article; zbMATH DE number 784425
• An Adaptable Scheduling Algorithm for Flexible Flow Lines

Cited in

(6)

• An improved L-shaped method for solving process flexibility design problems
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• scientific article; zbMATH DE number 4093162 (Why is no real title available?)
• scientific article; zbMATH DE number 1998826 (Why is no real title available?)
• Trade-off between time complexity and makespan for flexible flow-shop group scheduling problems with two machine centers
• Scheduling algorithms for flexible flowshops: Worst and average case performance

This page was built for publication: Solving flexible flow-shop problems by LPT and LN scheduling algorithms

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