The shifting bottleneck procedure for job shop scheduling
Management Science
Two scheduling problems with fuzzy due-dates
Fuzzy Sets and Systems - Special issue on industrial engineering methods
Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems
Fuzzy Sets and Systems - Special issue on operations research
A genetic algorithm for the job shop problem
Computers and Operations Research - Special issue on genetic algorithms
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
Genetic Algorithms
Jobshop scheduling with imprecise durations: a fuzzy approach
IEEE Transactions on Fuzzy Systems
| Hi-index | 0.00 |
Job-shop scheduling is a difficult problem, both theoretically and practically. The theoretical problems stem from the search for optimal schedules subject to a limited number of constraints, while the complexity of practical problems is due to the number and variety of constraints that are not rigid in the actual situations. Actually, the job-shop scheduling problem is a combinatorial optimization of considerable industrial importance. Although this 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 a fuzzy approach to the job-shop scheduling problem based on imprecise processing times. We first use triangular fuzzy numbers to represent imprecise processing times, and then construct a fuzzy job-shop scheduling model to solve the problem. Our work intends to extend the crisp job-shop scheduling problem, in the case of imprecise processing times, into a more generalized problem that would be useful in practical situations.