Parallel machine scheduling with family setup times

Çağıcı, Türker Tunga


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.
Parallel machine scheduling to minimize total cost functions
Azizoğlu, Meral; Kırca, Ömer; Department of Industrial Engineering (1994)
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 bio-inspired single source shortest path algorithms
Arslan, Hilal; Manguoğlu, Murat; Department of Computer Engineering (2017)
Real-world shortest path problems that usually dynamically change are challeng- ing and computationally expensive, and earlier studies in the literature require pro- hibitively long time to obtain the solution. To cope with such problems, we introduce novel bio-inspired parallel algorithms based on Physarum Solver. The first proposed algorithm is a fast and efficient parallel Physarum Solver with the objective to find the shortest path for static graphs with positive edge weights. Next, we propose a novel f...
Parallel machine match-up scheduling with manufacturing cost considerations
Akturk, M. Selim; Atamturk, Alper; Gürel, Sinan (Springer Science and Business Media LLC, 2010-02-01)
Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the manufacturing cost implications in response to disruptions. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain manufacturing cost, which is a convex functi...
Citation Formats
T. T. Çağıcı, “Parallel machine scheduling with family setup times,” Middle East Technical University, 1999.