scientific article; zbMATH DE number 4143766
From MaRDI portal
Publication:3475121
Recommendations
- scientific article; zbMATH DE number 4158358
- scientific article; zbMATH DE number 4085400
- A two-machine flow shop scheduling problem with controllable job processing times
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- scientific article; zbMATH DE number 4074798
Cited in
(7)- Time complexity and linear-time approximation of the ancient two-machine flow shop
- Variants of the two machine flow shop problem connected with factorization of matrix functions
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- scientific article; zbMATH DE number 3891077 (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?)
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 Q3475121)
