Rescheduling with total flow time and number of disrupted jobs criteria

Özlen, Melih
Azizoğlu, Meral
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.
35th International Conference on Computers and Industrial Engineering, ICC and IE 2005 (19 - 22 Haziran 2005)


Rescheduling of identical parallel machines under machine eligibility constraints
Alagoz, O; Azizoğlu, Meral (2003-09-16)
In this study, we address a rescheduling problem in parallel machine environments under machine eligibility constraints. We consider total flow time as efficiency measure and the number of jobs processed on different machines in the initial and revised schedules as a stability measure. We present an optimizing algorithm for minimizing the stability measure subject to the constraint that the efficiency measure is at its minimum level. We then propose several heuristic procedures to generate a set of approxim...
Parallel-machine rescheduling with machine disruptions
Azizoğlu, Meral (Informa UK Limited, 2005-12-01)
In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.
Parallel machine scheduling with family setup times to minimize total flowtime
Azizoğlu, Meral; Kondakci, Suna (International Forum of Management Scholars (INFOMS), 2002-12-01)
In this study, we consider parallel machine scheduling problem with family setup times. Our criterion is to minimize total flowtime. We develop a branch and bound algorithm using an efficient branching scheme and powerful lower and upper bounds. Our computational experiment has shown that the algorithm finds optimal solutions to moderate-sized problems in reasonable CPU times.
Spread time considerations in operational fixed job scheduling
Eliiyi, D. T.; Azizoğlu, Meral (Informa UK Limited, 2006-10-15)
In this study, we consider the operational fixed job scheduling problem on identical parallel machines. We assume that the jobs have fixed ready times and deadlines, and spread time constraints are imposed on machines. Our objective is to select a set of jobs for processing so as to maximise the total weight. We show that the problem is strongly NP-hard, and we investigate several special polynomially solvable cases. We propose a branch and bound algorithm that employs size reduction mechanisms, dominance c...
Comparison of Kalman filter and Bayesian-MAP approaches in the spatio-temporal solution of the inverse electrocardiography Ters elektrokardiyografinin zaman-uzamsal çözümünde Kalman filtre ve Bayes-MAP yöntemlerinin karşilaştirilmasi
Aydin, Ümit; Serinağaoğlu Doğrusöz, Yeşim (2010-07-15)
In this study some of the spatial and spatio-temporal methods for the solution of the inverse problem of electrocardiography (ECG) are compared with each other. Comparisons are also made for the cases with geometric errors, where the location of the heart is shifted for 10mm and the size of the heart is reduced by 5%. The compared methods are the Kalman filter and Bayesian maximum a posteriori estimation (MAP). Two different Bayesian-MAP algorithms are used. While one uses only spatial information the other...
Citation Formats
M. Özlen and M. Azizoğlu, “Rescheduling with total flow time and number of disrupted jobs criteria,” İstanbul, Türkiye, 2005, p. 1529, Accessed: 00, 2021. [Online]. Available: