Heuristic search techniques in problem reduction method.

1988
Arteimi, Mohammed A
Show full item record
73
views
0
downloads
https://hdl.handle.net/11511/7979
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Heuristic approaches for solid transportation-p-facility location problem
Das, Soumen Kumar; Roy, Sankar Kumar; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2020-09-01)
Determining optimum places for the facilities and optimum transportation from existing sites to the facilities belongs to the main problems in supply chain management. Thesolid transportation-p-facility location problem(ST-p-FLP) is an integration between thefacility location problemand thesolid transportation problem(STP). This paper delineates the ST-p-FLP, a generalization of the classical STP in which location ofp-potential facility sites are sought so that the total transportation cost by means of conv...
Heuristic and exact methods for the large-scale discrete time-cost trade-off problems
Aminbakhsh, Saman; Sönmez, Rifat; Atan, S. Tankut; Department of Civil Engineering (2018)
Construction industry necessitates formulating impeccable plans by decision makers for securing optimal outcomes. Managers often face the challenge of compromising between diverse and usually conflicting objectives. Particularly, accurate decisions on the time and cost must be made in every construction project since project success is chiefly related to these objectives. This is realized by addressing the time-cost trade-off problem (TCTP) which is an optimization problem and its objective is to identify t...
Heuristic procedures for multi-item dynamic lot sizing problem with set-up times
Uluöz, B Deniz; Kırca, Ömer; Department of Industrial Engineering (1988)
Heuristic and exact approaches for multi-objective routing
Tezcaner Öztürk, Diclehan; Köksalan, Murat; Department of Industrial Engineering (2013)
In this thesis, we consider the bi-objective routing problem. This problem is a combination of the bi-objective shortest path problem (finding the efficient arcs between nodes) and the bi-objective traveling salesperson problem (finding the efficient tours composed of efficient arcs). We develop solution procedures to find efficient tours. We consider two different terrain structures; discretized terrain and continuous terrain. In the discretized terrain, the terrain is approximated with grids and we allow ...
Heuristics for operational fixed job scheduling problems with working and spread time constraints
Eliiyi, Deniz Tursel; Azizoğlu, Meral (Elsevier BV, 2011-07-01)
Operational fixed job scheduling problems select a set of jobs having fixed ready and processing times and schedule the selected jobs on parallel machines so as to maximize the total weight. In this study, we consider working time and spread time constrained versions of the operational fixed job scheduling problems. The working time constraints limit the total processing load on each machine. The spread time constraints limit the time between the start of the first job and the finish of the last job on each...
Citation Formats
M. A. Arteimi, “Heuristic search techniques in problem reduction method.,” Middle East Technical University, 1988.
METU IIS - Integrated Information Service open@metu.edu.tr