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
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Rescheduling with total flow time and number of disrupted jobs criteria
Date
2005-12-01
Author
Özlen, Melih
AZİZOĞLU, MERAL
Metadata
Show full item record
Item Usage Stats
3
views
0
downloads
Cite This
This study considers a rescheduling problem on parallel unrelated machines. We assume there is a disruption of known duration on one machine. After disruption, we aim to reschedule so as to minimize total flow time and number of disrupted jobs. We generate all efficient schedules with respect to these criteria.
Subject Keywords
Efficient solutions
,
Parallel unrelated machines
,
Rescheduling
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84886894771&origin=inward
https://hdl.handle.net/11511/72901
Collections
Department of Industrial Design, Conference / Seminar
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Özlen and M. AZİZOĞLU, “Rescheduling with total flow time and number of disrupted jobs criteria,” İstanbul, Türkiye, 2005, p. 1529, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84886894771&origin=inward.
