Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
A simulated annealing approach to bicriteria scheduling problems on a single machine
Date
2000-08-01
Author
Karasakal, Esra
Koksalan, M
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
7
views
0
downloads
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.
Subject Keywords
Simulated annealing
,
Heuristics
,
Single machine scheduling
,
Bicriteria scheduling
,
Flowtime
,
Maximum earliness
,
Number of tardy jobs
URI
https://hdl.handle.net/11511/40064
Journal
JOURNAL OF HEURISTICS
DOI
https://doi.org/10.1023/a:1009622230725
Collections
Department of Industrial Engineering, Article