Lot splitting heuristic for three-stage flow shop scheduling

Download
076054.pdf
1998
Dalgıç, Nevzat
Show full item record
71
views
0
downloads
https://hdl.handle.net/11511/2140
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

LOT STREAMING IN A 2-STAGE FLOW-SHOP WITH SET-UP, PROCESSING AND REMOVAL TIMES SEPARATED
CETINKAYA, FC (Informa UK Limited, 1994-12-01)
This paper considers the job (lot) scheduling problem for two-stage flow shops in which the movement of transfer batches (sublots) from the first stage to the next are allowed. Set-up, processing and removal times are considered as separable and independent of the order in which jobs are processed at any of two stages. An optimal transfer batch sizing and scheduling algorithm which has an objective of minimizing the maximum flow time (makespan) is developed and demonstrated by a numerical example.
Lot scheduling with transfer batches in multi-stage shops
Çetinkaya, Ferda Can; Kayalıgil, Sinan; Department of Industrial Engineering (1996)
Lot splitting under learning effects with minimal revenue requirements and multiple lot types
Serin, Yaşar Yasemin (2003-08-01)
The lot splitting problem in the presence of learning is addressed. This work is an extension of an approach proposed for splitting in the case of a single item. We address the issue of a minimal revenue requirement from partial deliveries until a predetermined time. This is achieved by imposing a constraint on what is originally an unconstrained optimization problem. When sublots of different items are involved, the optimal splitting decisions have to be combined with the sequencing of the deliveries. Nume...
Part-Aware Distance Fields for Easy Inbetweening in Arbitrary Dimensions
Tarı, Zehra Sibel (2013-07-01)
The motivation for this work is to explore a possible computer graphics application for a part aware distance field developed recently. Computing in-between shapes is chosen as a toy application. Rather than presenting a highly competitive scheme which continuously morphs one shape into another, our aim is to investigate whether in-betweens may be defined as ordinary averages once a proper shape representation (e.g. a part aware field) is established. The constructions are independent of the dimension of th...
Part-Aware distance fields for easy Inbetweening in arbitrary dimensions
Tarı, Zehra Sibel (Springer International Publishing, 2015-01-01)
Citation Formats
N. Dalgıç, “Lot splitting heuristic for three-stage flow shop scheduling,” Middle East Technical University, 1998.
METU IIS - Integrated Information Service open@metu.edu.tr