Scheduling with multiple performance measures: the one-machine case
Management Science
Convergence of an annealing algorithm
Mathematical Programming: Series A and B
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Scheduling with release dates on a single machine to minimize total weighted completion time
Discrete Applied Mathematics
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain
Computers and Industrial Engineering
A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem
Expert Systems with Applications: An International Journal
A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain
Computers and Industrial Engineering
Journal of Intelligent Manufacturing
International Journal of Applied Evolutionary Computation
Hi-index | 0.00 |
In this paper, we apply a simulated annealing approach to two bicriteria scheduling problems on a single machine. The first problem is the strongly NP-hard problem of minimizing total flowtime and maximum earliness. The second one is the NP-hard problem of minimizing total flowtime and number of tardy jobs. We experiment on different neighbourhood structures as well as other parameters of the simulated annealing approach to improve its performance. Our computational experiments show that the developed approach yields solutions that are very close to lower bounds and hence very close to the optimal solutions of their corresponding problems for the minimization of total flowtime and maximum earliness. For the minimization of total flowtime and number tardy, our experiments show that the simulated annealing approach yields results that are superior to randomly generated schedules.