Parallel-machine rescheduling with machine disruptions

Date

2005-12-01

Author

Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

147
views

0
downloads

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.

Subject Keywords

Industrial and Manufacturing Engineering

URI

https://hdl.handle.net/11511/46798

Journal

IIE TRANSACTIONS

DOI

https://doi.org/10.1080/07408170500288133

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Spread time considerations in operational fixed job scheduling Eliiyi, D. T.; Azizoğlu, Meral (Informa UK Limited, 2006-10-15) In this study, we consider the operational fixed job scheduling problem on identical parallel machines. We assume that the jobs have fixed ready times and deadlines, and spread time constraints are imposed on machines. Our objective is to select a set of jobs for processing so as to maximise the total weight. We show that the problem is strongly NP-hard, and we investigate several special polynomially solvable cases. We propose a branch and bound algorithm that employs size reduction mechanisms, dominance c...
Operational fixed interval scheduling problem on uniform parallel machines Bekki, Oezguen Baris; Azizoğlu, Meral (Elsevier BV, 2008-04-01) In this study, we address an operational fixed interval scheduling problem on uniform parallel machines. Our objective is to maximize the total weight of the jobs processed. We show that the problem is NP-hard in the strong sense and develop polynomial time algorithms for some special cases. We propose a branch and bound algorithm that employs dominance conditions and tight bounds. The results of our computational tests have revealed that the algorithm returns optimal solutions for problem instances with up...
A comparison of orthogonal cutting data from experiments with three different finite element models Bil, H; Kilic, SE; Tekkaya, AE (Elsevier BV, 2004-07-01) The aim of this study is to compare various simulation models of orthogonal cutting process with each other as well as with the results of various experiments. Commercial implicit finite element codes MSC.Marc, Deform2D and the explicit code Thirdwave AdvantEdge have been used. In simulations, a rigid tool is advanced incrementally into the deformable workpiece which is remeshed whenever needed. In simulations with MSC.Marc and Thirdwave AdvantEdge, there is no separation criterion defined since chip format...
Flow shop-sequencing problem with synchronous transfers and makespan minimization Soylu, B.; Kirca, Ou; Azizoğlu, Meral (Informa UK Limited, 2007-01-01) This study considers a permutation flow shop-sequencing problem with synchronous transfers between stations. The objective is to minimize the makespan. It is shown that the problem is strongly NP-hard. A branch-and-bound algorithm together with several lower and upper bounding procedures are developed. The algorithm returns optimal solutions to moderate-sized problem instances in reasonable solution times.
Interval priority weight generation from interval comparison matrices in analytic hierarchy process Öztürk, Ufuk; Karasakal, Esra; Department of Industrial Engineering (2009) In this study, for the well-known Analytic Hierarchy Process (AHP) method a new approach to interval priority weight generation from interval comparison matrix is proposed. This method can be used for both inconsistent and consistent matrices. Also for the problems having more than two hierarchical levels a synthesizing heuristic is presented. The performances of the methods, interval generation and synthesizing, are compared with the methods that are already available in the literature on randomly generate...

Citation Formats

M. Azizoğlu, “Parallel-machine rescheduling with machine disruptions,” IIE TRANSACTIONS, pp. 1113–1118, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46798.