Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Bicriteria scheduling using genetic algorithms
Download
082661.pdf
Date
1999
Author
Keha, Ahmet Burak
Metadata
Show full item record
Item Usage Stats
87
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/2292
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Bicriteria Multiresource Generalized Assignment Problem
Karsu, Ozlem; Azizoğlu, Meral (2014-12-01)
In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. (c) 2014 Wiley Periodicals, Inc. Naval Research Logistics...
Bicriteria scheduling of unit processing time jobs on a single machine
Emre, Elif; Kondakçı Köksalan, Suna; Department of Industrial Engineering (1994)
Bicriteria bin packing problem with deviation based objectives
Öylek, Ayla; Karasakal, Esra; Azizoğlu, Meral; Department of Industrial Engineering (2015)
In this thesis, two bicriteria bin packing problems are addressed. Bin packing problem is an NP-hard combinatorial optimization problem. Items with different weights are packed into bins with limited capacity in order to minimize the required number of bins. Objectives of the first problem are minimizing the number of bins and minimizing the total overdeviation. In the second problem, minimization of the number of bins and minimization of the maximum overdeviation are two conflicting objectives. For the sol...
Bicriteria scheduling of a material handling robot in an m-machine cell to minimize the energy consumption of the robot and the cycle time
Gultekin, Hakan; Gürel, Sinan; Taspinar, Rabia (2021-12-01)
This study considers a flowshop type production system consisting of m machines. A material handling robot transports the parts between the machines and loads and unloads the machines. We consider the sequencing of the robot moves and determining the speeds of these moves simultaneously. These decisions affect both the robot's energy consumption and the production speed of the system. In this study, these two objectives are considered simultaneously. We propose a second order cone programming formulation to...
Multiresolution behavioral modeling in a virtual environment
Koldaş, Gürkan; İşler, Veysi; Department of Computer Engineering (2000)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. B. Keha, “Bicriteria scheduling using genetic algorithms,” Middle East Technical University, 1999.