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
Scheduling with bicriteria: total flowtime and number of tardy jobs
Date
1997-11-06
Author
Kondakci, SK
Bekiroglu, T
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
172
views
0
downloads
Cite This
In this paper the problem of minimizing total flowtime and number of tardy jobs on a single machine is considered. Some properties of the nondominated solutions are discussed. Computational results on the usefulness of developed properties for problems having up to 30 jobs are reported.
Subject Keywords
Scheduling
,
Bicriteria
,
Single machine
URI
https://hdl.handle.net/11511/65329
Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
DOI
https://doi.org/10.1016/s0925-5273(97)00099-6
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Using genetic algorithms for single-machine bicriteria scheduling problems
Köksalan, Mustafa Murat; Keha, AB (2003-03-16)
We consider two bicriteria scheduling problems on a single machine: minimizing flowtime and number of tardy jobs, and minimizing flowtime and maximum earliness. Both problems are known to be NP-hard. For the first problem, we developed a heuristic that produces an approximately efficient solution (AES) for each possible value the number of tardy jobs can take over the set of efficient solutions. We developed a genetic algorithm (GA) that further improves the AESs. We then adapted the GA for the second probl...
AN EFFICIENT ALGORITHM FOR THE SINGLE-MACHINE TARDINESS PROBLEM
KONDAKCI, S; KIRCA, O; Azizoğlu, Meral (1994-09-01)
This study considers the problem of minimizing total tardiness on a single machine. A simple and efficient lower bound and several upper bounds are developed. A branch and bound procedure incorporating the bounds, precedence relations and dominance properties is proposed. An experiment is designed to test the efficiency of the bounds, precedence relations and the branch and bound procedure. Computational experience with problems up to 35 jobs is reported.
Rescheduling of identical parallel machines under machine eligibility constraints
Alagoz, O; Azizoğlu, Meral (2003-09-16)
In this study, we address a rescheduling problem in parallel machine environments under machine eligibility constraints. We consider total flow time as efficiency measure and the number of jobs processed on different machines in the initial and revised schedules as a stability measure. We present an optimizing algorithm for minimizing the stability measure subject to the constraint that the efficiency measure is at its minimum level. We then propose several heuristic procedures to generate a set of approxim...
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.
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria
Ozlen, M.; Azizoğlu, Meral (Informa UK Limited, 2011-01-01)
In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the follo...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Kondakci and T. Bekiroglu, “Scheduling with bicriteria: total flowtime and number of tardy jobs,”
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
, pp. 91–99, 1997, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65329.