Scheduling with dual performance measures: Total flowtime and number of tardy jobs.

Download
023573.pdf
1992
Bekiroğlu, K Tuncay
Show full item record
94
views
0
downloads
https://hdl.handle.net/11511/9829
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Scheduling with bicriteria: total flowtime and number of tardy jobs
Kondakci, SK; Bekiroglu, T (1997-11-06)
In this paper the problem of minimizing total flowtime and number of tardy jobs on a single machine is considered. Some properties of the nondominated solutions are discussed. Computational results on the usefulness of developed properties for problems having up to 30 jobs are reported.
Scheduling approaches for parameter sweep applications in a heterogeneous distributed environment
Karaduman, Gülşah; Şener, Cevat; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2010)
In this thesis, the focus is on the development of scheduling algorithms for Sim-PETEK which is a framework for parallel and distributed execution of simulations. Since it is especially designed for running parameter sweep applications in a heterogeneous distributed computational environment, multi-round and adaptive scheduling approaches are followed. Five different scheduling algorithms are designed and evaluated for scheduling purposes of Sim-PETEK. Development of these algorithms are arranged in a way t...
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoğlu, Meral; Koksalan, SK (Informa UK Limited, 2003-06-01)
We address the bicriteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algori...
Scheduling a batch processing machine with non-identical job sizes
Azizoğlu, Meral (2000-07-10)
The problem of scheduling batch processors is important in some industries and, at a more fundamental level, captures an element of complexity common to many practical scheduling problems. We describe a branch and bound procedure applicable to a batch processor model with arbitrary job processing times, job weights and job sizes. The scheduling objective is to minimize total weighted completion time. We find that the procedure returns optimal solutions to problems of up to similar to 25 jobs in reasonable C...
Scheduling methods for linear projects a comprehensive study
Rabie, Mounzer; Pultar, Mustafa; Department of Building Sciences (1990)
Citation Formats
K. T. Bekiroğlu, “ Scheduling with dual performance measures: Total flowtime and number of tardy jobs.,” Middle East Technical University, 1992.
METU IIS - Integrated Information Service open@metu.edu.tr