Parallel machine scheduling with family setup times to minimize total flowtime

Date

2002-12-01

Author

Azizoğlu, Meral
Kondakci, Suna

Metadata

Show full item record

Item Usage Stats

191
views

0
downloads

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.

Subject Keywords

Branch and Bound , Family Setup Times , Parallel Machines

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84874251961&origin=inward
https://hdl.handle.net/11511/84812
https://www.scopus.com/record/display.uri?eid=2-s2.0-84874251961&origin=resultslist&sort=plf-f&src=s&st1=&st2=&sid=a5f68c675a3f08428595aa5e8e05fa26&sot=b&sdt=b&sl=94&s=TITLE-ABS-KEY+%28Parallel+machine+scheduling+with+family+setup+times+to+minimize+total+flowtime%29&relpos=1&citeCnt=0&searchTerm=

Journal

International Journal of Operations and Quantitative Management

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Uniform Parallel machine scheduling with family set-up times Tamer, Meral; Azizoğlu, Meral; Azizoğlu, Meral; Department of Industrial Engineering (2003) In this study, we address the scheduling problem of uniform parallel machines with family set-up times so as to minimize the total completion time. We develop a branch and jound algorithm that employs an efficient branching scheme. A bounding mechanism is jroposed to increase the efficiency of this algorithm. Our computational experiment shows hat the optimal solution is found in reasonable CPU times up to 15 jobs. Further experiments »re conducted to test the bounding mechanisms and this experiment indicat...
Dynamic programming algorithms for scheduling parallel machines with family setup times Webster, Scott; Azizoğlu, Meral (Elsevier BV, 2001-2) We address the problem of scheduling jobs with family setup times on identical parallel machines to minimize total weighted flowtime. We present two dynamic programming algorithms - a backward algorithm and a forward algorithm - and we identify characteristics of problems where each algorithm is best suited. We also derive two properties that improve the computational efficiency of the algorithms. Scope and purpose While most production schedulers must balance conflicting goals of high system efficiency and...
On the minimization of total weighted flow time with identical and uniform parallel machines Azizoğlu, Meral (1999-02-16) We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total weighted flow time. We discuss the properties that characterize the structure of an optimal solution, present a lower bound and propose a branch and bound algorithm. The algorithm is superior to prior methods presented in the literature. We also extend the algorithm to uniform parallel machines and solve medium-sized problem instances.
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.
Rescheduling with total flow time and number of disrupted jobs criteria Özlen, Melih; Azizoğlu, Meral (2005-12-01) This study considers a rescheduling problem on parallel unrelated machines. We assume there is a disruption of known duration on one machine. After disruption, we aim to reschedule so as to minimize total flow time and number of disrupted jobs. We generate all efficient schedules with respect to these criteria.

Citation Formats

M. Azizoğlu and S. Kondakci, “Parallel machine scheduling with family setup times to minimize total flowtime,” International Journal of Operations and Quantitative Management, pp. 47–56, 2002, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84874251961&origin=inward.