Heuristic procedures for the lot sizing problem with assembly structures

Download
009663.pdf
1990
İrfanoğlu, Orhan
Show full item record
73
views
0
downloads
https://hdl.handle.net/11511/6332
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Heuristic algorithms for the routing problems with backhauls
Demirel, Özgür; Süral, Haldun; Department of Industrial Engineering (2001)
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 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...
Heuristics for Dynamic Scheduling of Multi-Class Base-Stock Controlled Systems
Kat, Bora; Avşar, Zeynep Müge (2005-05-20)
Dynamic scheduling of an exponential single-server facility processing different types of items one by one is studied for the case of Poisson demand arrivals. Inventories of the items are managed by base-stock policies and backordering is allowed. Structure of the optimal scheduling policy is investigated numerically with respect to a weighted average of the fill rates. Performance of the optimal policy is compared to those of two well-known policies, Longest Queue and First-Come-First-Served, and alternati...
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
O. İrfanoğlu, “Heuristic procedures for the lot sizing problem with assembly structures,” Middle East Technical University, 1990.
METU IIS - Integrated Information Service open@metu.edu.tr