scientific article; zbMATH DE number 4158358

MaRDI QIDQ3486356zbMATH OpenFDO

Authors Eugeniusz Nowicki

Publication date 1989

zbMATH Keywords

approximation algorithmtwo-machine flow-shopvariable job processing timesworst-case

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4089300
• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
• scientific article; zbMATH DE number 1131737
• scientific article; zbMATH DE number 1911010
• The flow shop problem with time lags and separated setup times
• scientific article; zbMATH DE number 4147845
• Flow constrained minimum cost flow problem
• A flexible flowshop problem with total flow time minimization
• Two-machine flow shop scheduling problem under linear constraints
• An optimal production flow control problem with piecewise constant demand

Cited in

(6)

• A two-machine flow shop scheduling problem with controllable job processing times
• scientific article; zbMATH DE number 4143766 (Why is no real title available?)
• scientific article; zbMATH DE number 4085399 (Why is no real title available?)
• scientific article; zbMATH DE number 4085400 (Why is no real title available?)
• Two machine flow shop scheduling problem with weighted WIP costs
• Flow shops with WIP and value added costs

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