Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Batch scheduling duling of incompatible jobs on a single reactor with dynamic arrivals
Date
2004
Author
Korkmaz, Gediz
Metadata
Show full item record
Item Usage Stats
217
views
0
downloads
Cite This
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.
Subject Keywords
Production management.
URI
https://hdl.handle.net/11511/14258
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
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...
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...
Analyzing cost structure in logistics sector : a sytem dynamics approach
Kuzucu, Ayşegül; Sayın, Erol; Department of Industrial Engineering (2005)
In today's conditions, systems that surround individuals have evolved in structure such that, nature of variable interactions are much more complex and changing continuously. Logistics systems, which constitute an example for such systems, have also necessitated fast management and decision-making in a fast paced environment, under limited sources with the additional effect of increasing customer requirements and competition. In this study, system dynamics approach was shown to be a competent alternative to...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
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.