scientific article; zbMATH DE number 1998826

MaRDI QIDQ4433459zbMATH OpenFDO

Authors Czesław Smutnicki

Publication date 2 November 2003

Mathematics Subject Classification ID

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

Recommendations

• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Approximation algorithms
• Scheduling flexible flow lines with no in-process buffers
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Solving flexible flow-shop problems by LPT and LN scheduling algorithms

Cited in

(8)

• Complexity of workforce scheduling in transfer lines
• A simulation analysis of sequencing rules in a flexible flowline
• Solving flexible flow-shop problems by LPT and LN scheduling algorithms
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Approximation algorithms
• Scheduling flexible flow lines with no in-process buffers
• Scheduling in dial-indexed production lines
• Conceptual framework for lot-sizing and scheduling of flexible flow lines

This page was built for publication:

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