A selection method of reasonable non-dominated schedules on scheduling

Author

Han, Sang-Su ; Ishii, Hiroaki

Author_Institution

Dept. of Manage. & Inf. Sci., Osaka Int. Univ., Osaka, Japan

Volume

3

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

991

Abstract

A selection method for non-dominated schedules for a bi-objective open shop scheduling problem are considered. We treat an open shop scheduling problem on two machines with fuzzy processing times of jobs and with fuzzy due dates of machines. We introduce a possibility distribution function of the processing time for each job and a membership function of the due date of the machine. Thus the processing times and due dates are not constants as in ordinary scheduling problems but decision variables reflecting the fuzzy circumstance of job processing. We propose algorithms for the selection method of reasonable schedules from non-dominated schedules to maximize minimum degree of possibility for the job processing and maximum satisfaction level for the job completion, simultaneously

Keywords

decision theory; fuzzy set theory; possibility theory; production control; bi-objective open shop scheduling problem; decision variables; fuzzy due dates; fuzzy processing times; job completion; maximum satisfaction level; membership function; possibility distribution function; reasonable nondominated schedules; selection method; Distribution functions; Engineering management; Fuzzy sets; Information management; Information science; Job shop scheduling; Optimal scheduling; Polynomials; Scheduling algorithm; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on

Conference_Location

Tokyo

ISSN

1062-922X

Print_ISBN

0-7803-5731-0

Type

conf

DOI

10.1109/ICSMC.1999.823363

Filename

823363