Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Tardiness minimization on parallel machines
Date
1998-07-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
220
views
0
downloads
Cite This
We consider the NP-hard problem of scheduling jobs on identical parallel machines to minimize total tardiness. We present properties that characterize the structure of an optimal schedule. We propose a branch and bound algorithm that incorporates the properties along with an efficient lower bounding scheme.We find that optimal solutions can be obtained in reasonable times for problems with up to 15 jobs. In the last part of the study we extend the results to uniform parallel machines.
Subject Keywords
Scheduling
,
Parallel machines
,
Total tardiness
,
Branch and bound
URI
https://hdl.handle.net/11511/34448
Journal
International Journal of Production Economics
DOI
https://doi.org/10.1016/s0925-5273(98)00034-6
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
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.
Preemptive scheduling on identical parallel machines subject to deadlines
Azizoğlu, Meral (2003-07-01)
We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel machines so as to minimize total completion time. We show that the problem is polynomially solvable when the processing times and deadlines are agreeable.
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...
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.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Azizoğlu, “Tardiness minimization on parallel machines,”
International Journal of Production Economics
, pp. 163–168, 1998, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34448.