Batch scheduling duling of incompatible jobs on a single reactor with dynamic arrivals

2004
Korkmaz, Gediz
In this study, a single machine batch-scheduling problem with incompatible jobs and dynamic arrivals is examined. The objective function is the minimization of the total flow time of the jobs. For solving problems a case specific branch and bound algorithm with a heuristic upper bound scheme and two alternative lower bound procedures is used. An extensive computational experiment is conducted to investigate the effects of certain parameters on the computation time. For the most difficult parameter combination branch and bound algorithm can solve the problems about 25 jobs with 4 different job types in a 10 minutes time on average. For the problem types with higher number of jobs and the most difficult parameter combination proposed upper bound heuristic can be used to obtain near optimal solutions.

Suggestions

A new approach to generating non-permutation schedules for flowshops with missing operations
Tabalu, Metin; Şen, Tayyar; Department of Industrial Engineering (2006)
In this study, non-permutation flowshops with missing operations are considered. The primary performance criterion is the total cycle time (i.e. makespan) and the secondary criterion is the total flowtime. In order to obtain the schedule with minimum makespan and minimum total flowtime, non-permutation schedules are being generated instead of permutation ones by permitting multiple jobs bypassing stages where misisng operations occur. A heuristic algorithm has been developed in order to generate non-permuta...
Two-sided assembly line balancing models and heuristics
Arıkan, Uğur; Kırca, Ömer; Department of Industrial Engineering (2009)
This study is focused on two-sided assembly line balancing problems of type-I and type-II. This problem is encountered in production environments where a two-sided assembly line is used to produce physically large products. For type-I problems, there is a specified production target for a fixed time interval and the objective is to reach this production capacity with the minimum assembly line length used. On the other hand, type-II problem focuses on reaching the maximum production level using a fixed assem...
A linear programming approach to quaity improvement project and product mix selection under inspection error and rework
Şarbak, Nedret; Köksal, Gülser; Department of Industrial Engineering (2006)
In this study, the effect of inspection error on the product mix and quality projects selection in a manufacturing environment where rework and inspection errors exist is examined. It is assumed that the products (items) for which rework is necessary are reprocessed at a separate work center and 100% inspection is performed for the products both after rework and processing operations. Markov chain approach is used to compute yield and rework rates. In addition, nominal-the-best type of a quality loss functi...
A relational perspective of institutional work
Topal, Çağrı (Cambridge University Press (CUP), 2015-07-01)
This study develops a relational model of institutional work. The past research implies that the nature of relationships between individual actors actually shapes the nature of institutional work the actors engage in. However, the research falls short of an explicit, systematic analysis of different relationships between the actors and their work implications. This study basically argues that the actors' power positions, which might be dominant or subordinate in relation to those of other actors, and their ...
Evolutionary algorithms for deterministic and stochastic unconstrained function optimization
Koçkesen, Talip Kerem; Özdemirel, Nur Evin; Department of Industrial Engineering (2004)
Most classical unconstrained optimization methods require derivative information. Different methods have been proposed for problems where derivative information cannot be used. One class of these methods is heuristics including Evolutionary Algorithms (EAs). In this study, we propose EAs for unconstrained optimization under both deterministic and stochastic environments. We design a crossover operator that tries to lead the algorithm towards the global optimum even when the starting solutions are far from t...
Citation Formats
G. Korkmaz, “Batch scheduling duling of incompatible jobs on a single reactor with dynamic arrivals,” M.S. - Master of Science, Middle East Technical University, 2004.