Parallel machine scheduling to minimize total cost functions

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 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...
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.
Multi-objective combinatorial optimization using evolutionary algorithms Özsayın, Burcu; Köksalan, Murat; Department of Industrial Engineering (2009) Due to the complexity of multi-objective combinatorial optimization problems (MOCO), metaheuristics like multi-objective evolutionary algorithms (MOEA) are gaining importance to obtain a well-converged and well-dispersed Pareto-optimal frontier approximation. In this study, of the well-known MOCO problems, single-dimensional multi-objective knapsack problem and multi-objective assignment problem are taken into consideration. We develop a steady-state and elitist MOEA in order to approximate the Pareto-optim...
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.

Citation Formats

M. Azizoğlu, “Parallel machine scheduling to minimize total cost functions,” Ph.D. - Doctoral Program, Middle East Technical University, 1994.