On The Solution Of The Job-Shop Scheduling Problem Under Fl Zzv Environment

Abstract

This paper presents a solution algorithm for solving the job-shop scheduling problem involving fu/zy parameters in the constraints. It is considered that the processing times are those tuz/y parameters and the maximum completion time is required to be ininimi/ed. The concept of OC - level set together with the definition of the hi/./y number and Its membership function are introduced. An illustrative numerical example is given to claruv the theory and the solution algorithm