Abstract
Here we have n jobs on one machine where the processing times are triangular fuzzy numbers. The jobs are available to process without interruption. The purpose is to find a best sequence of the jobs that minimizes total fuzzy completion times and maximum fuzzy tardiness. In this paper a new definition is presented called D-strongly positive fuzzy number, then an exact solution of the problem through this definition is found. This definition opens new ideas about converting scheduling problems into fuzzy cases.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
