Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Ranking and defuzzification methods based on area compensation
Fuzzy Sets and Systems
| Hi-index | 0.00 |
The paper considers the problem of a single batch scheduling problem whose processing times are fuzzy numbers. The objective is to minimize the sum of completion times. A batch processing machines can handle up to B jobs simultaneously. The processing time of a batch is equal to the longest processing time among the jobs in the batch. A rule that the optical batch schedule satisfies is given and two algorithms are presented.