Job-shop scheduling problem with fuzzy processing times

CCUR > College of Natural Science and Engineering > College of Science > Department of Applied Mathematics > journal articles > Item 987654321/2995

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/2995

Title:	Job-shop scheduling problem with fuzzy processing times
Authors:	Lin FT
Contributors:	應數系
Date:	2001
Issue Date:	2009-12-11 10:50:40 (UTC+8)
Abstract:	Job-shop scheduling is a difficult problem, both theoretically and practically. This problem is a combinatorial optimization of considerable industrial importance. Although the job-shop scheduling problem has often been investigated, very little of this research is concerned with the uncertainty characterized by the imprecision in problem variables. In this paper, we investigate the job-shop scheduling problem with imprecise processing times. We first use triangular fuzzy numbers to represent imprecise processing times, and then construct a fuzzy job-shop scheduling model. Our work intends to extend the deterministic job-shop scheduling problem into a more generalized problem that would be useful in practical situations.
Relation:	COMPUTATIONAL SCIENCE -- ICCS 2001, PROCEEDINGS PT 2 Book Series: LECTURE NOTES IN COMPUTER SCIENCE Volume: 2074 Pages: 409-418
Appears in Collections:	[Department of Applied Mathematics] journal articles

Files in This Item:

There are no files associated with this item.