The shifting bottleneck procedure for job shop scheduling
Management Science
Job shop scheduling by simulated annealing
Operations Research
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
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. 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.