An Exact Solution for a Single Machine Scheduling Under Uncertainty

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 definiti...

Full description

Saved in:

Bibliographic Details
Published in:	Jambura journal of mathematics Vol. 5; no. 1; pp. 133 - 138
Main Authors:	Sharif, Rebaz Abdulla, Ramadan, Ayad M.
Format:	Journal Article
Language:	English
Published:	Department of Mathematics, Universitas Negeri Gorontalo 18-01-2023
Subjects:	efficient solutions fuzzy processing times fuzzy tardiness scheduling
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	2654-5616 2656-1344
DOI:	10.34312/jjom.v5i1.16156