Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.

From MaRDI portal
Publication:1426739
Jump to:navigation, search

DOI10.1016/S0165-0114(03)00178-7zbMath1044.90032MaRDI QIDQ1426739

Adam Kasperski, Stefan Chanas

Publication date: 15 March 2004

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


zbMATH Keywords

SchedulingSingle machineFuzzy numberDegree of optimality


Mathematics Subject Classification ID

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


Related Items (3)

On combinatorial optimization problems on matroids with uncertain weights ⋮ A possibilistic approach to sequencing problems with fuzzy parameters ⋮ Survey on fuzzy shop scheduling



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Optimal fuzzy counterparts of scheduling rules
  • Two scheduling problems with fuzzy due-dates
  • Fuzzy sets as a basis for a theory of possibility
  • The concept of a linguistic variable and its application to approximate reasoning. I
  • One machine scheduling problem with fuzzy duedates
  • Single machine, scheduling problem with fuzzy precedence relation
  • Scheduling under fuzziness
  • Critical path analysis in the network with fuzzy activity times


This page was built for publication: Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1426739&oldid=13599442"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 18:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki