scientific article; zbMATH DE number 1998822

MaRDI QIDQ4433455zbMATH OpenFDO

Authors Czesław Smutnicki

Publication date 15 December 2003

zbMATH Keywords

flow shop problemmean flow time criterion

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Some results of the worst-case analysis for flow shop scheduling
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Performance of scheduling algorithms for no-wait flowshops with parallel machines

Cited in

(4)

• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• Worst-case analysis of scheduling heuristics of parallel systems
• A note on worst-case analysis of approximation algorithms for a scheduling problem
• A worst-case analysis of the three-machine flow shop scheduling

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 Q4433455)