scientific article; zbMATH DE number 3904316

MaRDI QIDQ3682223zbMATH OpenFDO

Authors Jozef Grabowski, Czesław Smutnicki

Publication date 1984

zbMATH Keywords

algorithmblocks of jobs conceptbranch-and-boundcritical path conceptexperimental examinationflow-shop problemminimizing the maximum latenessnon-zero ready timesrolling-mill process

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 3854789
• scientific article; zbMATH DE number 3891076
• scientific article; zbMATH DE number 3984950
• Minimizing maximum lateness in a flow shop subject to release dates
• Minimising Maximum Lateness in a Two-Machine Flowshop

Cited in

(6)

• scientific article; zbMATH DE number 3843476 (Why is no real title available?)
• scientific article; zbMATH DE number 3854789 (Why is no real title available?)
• scientific article; zbMATH DE number 3891076 (Why is no real title available?)
• scientific article; zbMATH DE number 3891077 (Why is no real title available?)
• scientific article; zbMATH DE number 3984950 (Why is no real title available?)
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited

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