A heuristic for flowshops with total flow time minimization.

Download
056698.pdf
1996
Uslu Başaran, Ayşe Gülçin
Show full item record
131
views
0
downloads
https://hdl.handle.net/11511/9519
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

A multi-phase heuristic for the production routing problem
Solyali, Oguz; Süral, Haldun (2017-11-01)
This study considers the production routing problem where a plant produces and distributes a single item to multiple retailers over a multi-period time horizon. The problem is to decide on when and how much to produce and stock at the plant, when and how much to serve and stock at each retailer, and vehicle routes for shipments such that the sum of fixed production setup cost, variable production cost, distribution cost, and inventory carrying cost at the plant and retailers is minimized. A multi-phase heur...
A Counting-Based Heuristic for ILP-Based Concept Discovery Systems
Mutlu, Alev; Karagöz, Pınar; Kavurucu, Yusuf (2013-09-13)
Concept discovery systems are concerned with learning definitions of a specific relation in terms of other relations provided as background knowledge. Although such systems have a history of more than 20 years and successful applications in various domains, they are still vulnerable to scalability and efficiency issues - mainly due to large search spaces they build. In this study we propose a heuristic to select a target instance that will lead to smaller search space without sacrificing the accuracy. The p...
A special decomposition algorithm for block-diagonal linear with a single linking constraint.
Oğuz, Osman; Department of Industrial Engineering (1972)
A decomposition procedure for a large-scale linear program:National coal production and distribution system.
Gürbüz, H. Ibrahim; Department of Industrial Engineering (1983)
A genetic algorithm for the resource constrained project scheduling problem having a single machine with sequence dependent setup times
Kaya, Süleyman; Meral, Fatma Sedef; Department of Industrial Engineering (2013)
The scheduling problem considered in this study is the integration of two different problems in the scheduling area. One of the problems is the resource constrained project scheduling problem with renewable resources, while the other one is the single machine scheduling problem with sequence dependent setup times. In real life, project scheduling problems are usually complicated and include various scheduling problems characteristics. The objective of the problem addressed is the minimization of the complet...
Citation Formats
A. G. Uslu Başaran, “A heuristic for flowshops with total flow time minimization.,” Middle East Technical University, 1996.
METU IIS - Integrated Information Service open@metu.edu.tr