A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time

DOI10.16360/J.CNKI.JBNUNS.2017.02.001MaRDI QIDQ3131383zbMATH OpenFDO

Authors Jinquan Li, Wenyi Zeng, Qunzhi Wang

Publication date 29 January 2018

zbMATH Keywords

fuzzy numberdue date assignmentfuzzy schedulingpossibility variancepossibility mean value

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Stochastic scheduling theory in operations research (90B36)

Recommendations

• A weighted model and its algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
• Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times
• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• One machine scheduling problem with fuzzy duedates
• On two single machine scheduling problems with fuzzy processing times and fuzzy due dates

Cited in

(3)

• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times
• A weighted model and its algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time

This page was built for publication: A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3131383)