Flow shop scheduling problem with truncated learning effects

MaRDI QIDQ4574808zbMATH OpenFDO

Authors Xue-Ru Wang, Xuelian Bai, Ji-Bo Wang, Na Yin

Publication date 18 July 2018

zbMATH Keywords

branch and bound algorithmflow shopschedulingtotal weighted completion timetruncated learning effect

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
• Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
• Several flow shop scheduling problems with truncated position-based learning effect
• Flow-shop scheduling with a learning effect
• A bicriteria flowshop scheduling with a learning effect

Cited in

(4)

• Several flow shop scheduling problems with truncated position-based learning effect
• Flow-shop scheduling with a learning effect
• Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function

This page was built for publication: Flow shop scheduling problem with truncated learning effects

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