A possibilistic approach to sequencing problems with fuzzy parameters

DOI10.1016/j.fss.2004.09.007zbMath1074.90526OpenAlexW2017711201MaRDI QIDQ1770715

Adam Kasperski

Publication date: 7 April 2005

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2004.09.007

zbMATH Keywords

SchedulingSingle machineFuzzy numberPossibility distribution

Mathematics Subject Classification ID

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

Related Items (2)

SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM ⋮ Numerical methods for interval and fuzzy number comparison based on the probabilistic approach and Dempster-Shafer theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two scheduling problems with fuzzy due-dates
• One machine scheduling problem with fuzzy duedates
• Single machine scheduling to minimize the number of late jobs under uncertainty.
• Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
• The single machine ready time scheduling problem with fuzzy processing times
• Scheduling with fuzzy delays and fuzzy precedences.
• Scheduling under fuzziness
• Minimizing Total Tardiness on One Machine is NP-Hard
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: A possibilistic approach to sequencing problems with fuzzy parameters