Scheduling for flexible layout.

1985
Süer, Ahmet Gürsel
Show full item record
96
views
0
downloads
https://hdl.handle.net/11511/6281
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

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 algorithms for wireless cdma networks
Hakyemez, Serkan Ender; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2007)
In recent years the need for multimedia packet data services in wireless networks has grown rapidly. To overcome that need third generation (3G) mobile services have been proposed. The fast growing demands multimedia services in 3G services brought the need for higher capacity. As a result of this, the improvement on throughput, traffic serving performance has become necessary in 3G systems. Code division multiple access (CDMA) technique is one of the most important 3G wireless mobile techniques that has be...
Scheduling with dual performance measures: Total flowtime and number of tardy jobs.
Bekiroğlu, K Tuncay; Department of Industrial Engineering (1992)
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 methods for linear projects a comprehensive study
Rabie, Mounzer; Pultar, Mustafa; Department of Building Sciences (1990)
Citation Formats
A. G. Süer, “Scheduling for flexible layout.,” Middle East Technical University, 1985.
METU IIS - Integrated Information Service open@metu.edu.tr