Heuristic procedures for multi-item dynamic lot sizing problem with set-up times

Download
003606.pdf
1988
Uluöz, B Deniz
Show full item record
55
views
0
downloads
https://hdl.handle.net/11511/6310
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...
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...
Heuristics for a Continuous Multi-facility Location Allocation Problem with Demand Regions
Dinler, Derya; Tural, Mustafa Kemal; İyigün, Cem (null; 2013-07-01)
Heuristics for a continuous multi-facility location problem with demand regions
Dinler, Derya; Tural, Mustafa Kemal; İyigün, Cem; Department of Operational Research (2013)
We consider a continuous multi-facility location problem where the demanding entities are regions in the plane instead of points. Each region may consist of a finite or an infinite number of points. The service point of a station can be anywhere in the region that is assigned to it. We do not allow fractional assignments, that is, each region is assigned to exactly one facility. The problem we consider can be stated as follows: given m demand regions in the plane, find the locations of q facilities and allo...
Heuristics for a continuous multi-facility location problem with demand regions
Dinler, Derya; Tural, Mustafa Kemal; İyigün, Cem (Elsevier BV, 2015-10)
We propose mathematical programming formulations of the single and multiple facility versions of the problem considered. The single facility location problem is formulated as a second order cone programming (SOCP) problem, and hence is solvable in polynomial time. The multiple facility location problem is NP-hard in general and can be formulated as a mixed integer SOCP problem. This formulation is weak and does not even solve medium-size instances. To solve larger instances of the problem we propose three h...
Citation Formats
B. D. Uluöz, “Heuristic procedures for multi-item dynamic lot sizing problem with set-up times,” Middle East Technical University, 1988.
METU IIS - Integrated Information Service open@metu.edu.tr