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
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
Parallel machine scheduling to minimize total cost functions
Download
035725.pdf
Date
1994
Author
Azizoğlu, Meral
Metadata
Show full item record
Item Usage Stats
53
views
0
downloads
Cite This
Subject Keywords
Multimachine assignments
,
Parallel machine scheduling
,
Methods engineering
,
Costs, Industrial
URI
https://hdl.handle.net/11511/917
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Parallel flow shop schedulİng wİth common workstatİons
Çakıcı, Muhammet Kemal; Meral, Fatma Sedef; Department of Industrial Engineering (2019)
In this thesis, we address the parallel flow shop scheduling problem with common workstations to minimize the makespan, considering the flow shop design defined solely by the number of operators at the workstations. We are motivated by the production environment of a compressor manufacturing company located in Konya, Turkey. Different from the similar studies in the literature, we use common workstations at some of the stages, prefer to place limited buffer areas between the stages, and do not allow for job...
Parallel machine scheduling with family setup times to minimize total flowtime
Azizoğlu, Meral; Kondakci, Suna (International Forum of Management Scholars (INFOMS), 2002-12-01)
In this study, we consider parallel machine scheduling problem with family setup times. Our criterion is to minimize total flowtime. We develop a branch and bound algorithm using an efficient branching scheme and powerful lower and upper bounds. Our computational experiment has shown that the algorithm finds optimal solutions to moderate-sized problems in reasonable CPU times.
Parallelization of a transient method of lines Navier-Stokes code
Ersahin, C; Tarhan, T; Tuncer, İsmail Hakkı; Selçuk, Nevin (2004-01-01)
Parallel implementation of a serial code, namely method of lines ( MOL) solution for momentum equations (MOLS4ME), previously developed for the solution of transient Navier - Stokes equations for incompressible separated internal flows in regular and complex geometries, is described.
Parallel-machine rescheduling with machine disruptions
Azizoğlu, Meral (Informa UK Limited, 2005-12-01)
In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.
Preemptive scheduling on identical parallel machines subject to deadlines
Azizoğlu, Meral (2003-07-01)
We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel machines so as to minimize total completion time. We show that the problem is polynomially solvable when the processing times and deadlines are agreeable.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Azizoğlu, “Parallel machine scheduling to minimize total cost functions,” Ph.D. - Doctoral Program, Middle East Technical University, 1994.