Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times
From MaRDI portal
Recommendations
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
- A weighted model and its algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- scientific article; zbMATH DE number 1766737
Cited in
(5)- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
- scientific article; zbMATH DE number 1766737 (Why is no real title available?)
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- A weighted model and its algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
This page was built for publication: Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574795)