Note: Bicriteria scheduling for minimizing flow time and maximum tardiness

Date

1996-09-01

Author

Kondakci, SK
Azizoğlu, Meral
Koksalan, M

Metadata

Show full item record

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

Item Usage Stats

57
views

0
downloads

We consider the bicriteria problem of minimizing total flow time and maximum tardiness penalties for a given set of jobs on a single machine. We develop an algorithm that finds the optimal schedule for any given monotonic function of the two criteria by generating only a small subset of the efficient schedules. (C) 1996 John Wiley & Sons, Inc.

Subject Keywords

Management Science and Operations Research, General Engineering, Modelling and Simulation, Ocean Engineering

URI

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

Journal

NAVAL RESEARCH LOGISTICS

DOI

https://doi.org/10.1002/(sici)1520-6750(199609)43:6<929::aid-nav9>3.0.co;2-6

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A heuristic approach to bicriteria scheduling Köksalan, Mustafa Murat (Wiley, 1999-10-01) We consider the problem of sequencing jobs on a single machine while minimizing a nondecreasing function of two criteria. We develop a heuristic procedure that quickly finds a good solution for bicriteria scheduling. The procedure is based on using several arcs in the criterion space that are representative of the possible locations of nondominated solutions. By sampling a small number of points on these arcs, a promising point is identified in the criterion space for each are. An efficient sequence in the ...
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...
Working time constraints in operational fixed job scheduling Eliiyi, Deniz Tuersel; Azizoğlu, Meral (Informa UK Limited, 2010-01-01) In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs effic...
An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria Ulu, C; Köksalan, Mustafa Murat (Wiley, 2001-10-01) In this paper, we consider the multiple criteria decision-making problem of partitioning alternatives into acceptable and unacceptable sets. We develop interactive procedures for the cases when the underlying utility function of the decision maker is linear, quasiconcave, and general monotone. We present an application of the procedures to the problem of admitting students to the master's degree program at the Industrial Engineering Department, Middle East Technical University. (C) 2001 John Wiley & Sons, Inc.
Generating all efficient solutions of a rescheduling problem on unrelated parallel machines Ozlen, Melih; Azizoğlu, Meral (Informa UK Limited, 2009-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 stability measures. Our efficiency measure is the total flow time and stability measure is the total reassignment cost caused by the differences in the machine allocations in the initial and new schedules. We propose a branch and bound algorithm to generate all efficie...

Citation Formats

S. Kondakci, M. Azizoğlu, and M. Koksalan, “Note: Bicriteria scheduling for minimizing flow time and maximum tardiness,” NAVAL RESEARCH LOGISTICS, pp. 929–936, 1996, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37441.