AN EFFICIENT ALGORITHM FOR THE SINGLE-MACHINE TARDINESS PROBLEM

Date

1994-09-01

Author

KONDAKCI, S
KIRCA, O
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

195
views

0
downloads

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.

Subject Keywords

Scheduling, Single machine, Total tardiness

URI

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

Journal

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS

DOI

https://doi.org/10.1016/0925-5273(94)90026-4

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An interactive approach for multi-criteria sorting problems Keser, Burak; Köksalan, Murat; Department of Industrial Engineering (2005) This study is concerned with a sorting problem; the placement of alternatives into preference classes in the existence of multiple criteria. An interactive model is developed to address the problem, assuming that the decision maker has an underlying utility function which is linear. A recent methodology, Even-Swaps, which is based on value tradeoff is utilized in the model for both making an estimation of the underlying utility function and generating possible dominance among the alternatives on which it is...
Scheduling with bicriteria: total flowtime and number of tardy jobs Kondakci, SK; Bekiroglu, T (1997-11-06) 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.
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...
A fixed job scheduling problem with machine-dependent job weights Eliiyi, D. T.; Azizoğlu, Meral (2009-01-01) 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 a...
The Use of transitions, frame markers and code glosses in Turkish EFL learners’ opinion paragraphs Sancak, Diğdem; Gracanın Yüksek, Martına; Department of English Language Teaching (2019) The aim of this study is threefold: (i) to identify the types, frequencies and functions of the interactive metadiscourse devices such as transitions, frame markers and code glosses employed by Turkish learners of English in their English opinion paragraphs; (ii) to discover the reasons for the employment and avoidance of those markers by the Turkish EFL writers; (iii) to uncover the effect of teaching materials on the use of the scrutinized interactive metadiscourse markers. To fulfill these aims, data fro...

Citation Formats

S. KONDAKCI, O. KIRCA, and M. Azizoğlu, “AN EFFICIENT ALGORITHM FOR THE SINGLE-MACHINE TARDINESS PROBLEM,” INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, pp. 213–219, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34811.