Browsing by Author "Azizoglu, M."

Now showing 1 - 2 of 2

Citation - WoS: 9
Citation - Scopus: 8
A Fixed Job Scheduling Problem With Machine-Dependent Job Weights
(Taylor & Francis Ltd, 2009) Eliiyi, D. T.; Azizoglu, M.
This study considers the identical parallel machines operational fixed job scheduling problem with machine-dependent job weights. A job is either processed in a fixed interval or is not processed at all. Our aim is to maximise the total weight of the processed jobs. We show that the problem with machine eligibility constraints resides as a special case of this problem. We identify some special polynomially solvable cases and propose a branch-and-bound (BB) algorithm that employs efficient bounding schemes and dominance conditions. Computational experience on large-sized problem examples reveals the satisfactory performance of the BB algorithm.
Citation - WoS: 2
Citation - Scopus: 3
A Lagrangean Relaxation Based Approach for the Capacity Allocation Problem in Flexible Manufacturing Systems
(Taylor & Francis Ltd, 2010) Özpeynirci, Selin; Azizoglu, M.
This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower bounds on the optimal objective function values. The computational experiments show that our approach provides near optimal bounds in reasonable solution times. Journal of the Operational Research Society (2010) 61, 872-877. doi:10.1057/jors.2009.19