Solving fuzzy job shop scheduling problem based on interval number theory

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article discusses the job shop scheduling problem with fuzzy processing time and fuzzy deadline by using interval number theory, which is an efficient method to denote imprecise parameter. Firstly, we convert the original problem to constraint satisfaction problem (CSP) with the assumption that agreement index (AI) is a main optimization objective. Then, the particle swarm optimization (PSO) is merged with genetic algorithm (GA), i.e., an improved particle swarm optimization (IPSO) being used to solve the problem. Finally, the effectiveness of this algorithm is verified by large number of experiments. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

He, C., Qiu, D., & Guo, H. (2013). Solving fuzzy job shop scheduling problem based on interval number theory. In Lecture Notes in Electrical Engineering (Vol. 211 LNEE, pp. 393–401). https://doi.org/10.1007/978-3-642-34522-7_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free