scientific article; zbMATH DE number 3891076

MaRDI QIDQ3347608zbMATH OpenFDO

Authors Jozef Grabowski, Czesław Smutnicki

Publication date 1984

zbMATH Keywords

blocks of jobsbottleneck and non- bottleneck machinesbranch - and - bound type algorithmcritical sequenceflow-shop problemminimax objective functionsequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(10)

• Trading off between makespan and customer responsiveness in flow shop sequencing
• scientific article; zbMATH DE number 3854789 (Why is no real title available?)
• scientific article; zbMATH DE number 3891077 (Why is no real title available?)
• scientific article; zbMATH DE number 4143765 (Why is no real title available?)
• scientific article; zbMATH DE number 3904316 (Why is no real title available?)
• scientific article; zbMATH DE number 3984950 (Why is no real title available?)
• scientific article; zbMATH DE number 4076953 (Why is no real title available?)
• scientific article; zbMATH DE number 495274 (Why is no real title available?)
• Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
• Flow shop-sequencing problem with synchronous transfers and makespan minimization

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