Minimizing Total Tardiness on a Single Machine

Date

1990-01-01

Author

Azizoğlu, Meral
Kırca, Ömer

Metadata

Show full item record

Item Usage Stats

104
views

0
downloads

URI

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

Journal

Endüstri Mühendisliği

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Minimizing total flow time on a single flexible machine Karakayali, Ibrahim; Azizoğlu, Meral (Springer Science and Business Media LLC, 2006-03-01) In this study, we address a job sequencing and tool switching problem arising in flexible manufacturing systems. We consider the single machine problem of minimizing total flow time. We prove that the problem is NP-hard in the strong sense and show that the tool switching problem is polynomially solvable for a given sequence.
Minimizing Age of Information for Multiple Flows Beytur, Hasan Burhan; Uysal, Elif (2018-06-07) Age of Information (AoI) is an emerging metric measuring the freshness of a flow at its destination, which is critical for time-sensitive applications. We consider multiple flows served by a single server. To minimize the average AoI over all flows, we formulate preemptive and non-preemptive Maximum Age Difference (MAD) algorithms, and experimentally observe their superior performance with respect to various other scheduling algorithms for multi-flow networks. We also observe that both MAD and MAF (Maximum ...
Minimizing the Number of Detrimental Objects in Multi-Dimensional Graph-Based Codes Hareedy, Ahmed; Kuditipudi, Rohith; Calderbank, Robert (2020-09-01) © 1972-2012 IEEE.The increasing demand for access to data has led to dramatic increases in data storage densities, and as densities increase, new sources of error appear. Multi-dimensional (MD) graph-based codes are capable of mitigating error sources like interference and channel non-uniformity in dense storage devices. A recent innovation improves the performance of MD spatially-coupled codes that are based on circulants by carefully relocating some circulants to minimize the number of short cycles. Howev...
Minimizing the number of tool transporter movements in flexible manufacturing systems Kilinç, Fatma; Azizoğlu, Meral (null; 2005-12-01)
Minimizing uncertainty in rough control boundaries of robot path planning using dynamic decay adjustment (DDA) Sanal, Ufuk Zeki; Erkmen, Aydan; Department of Electrical and Electronics Engineering (2001)

Citation Formats

M. Azizoğlu and Ö. Kırca, “Minimizing Total Tardiness on a Single Machine,” Endüstri Mühendisliği, pp. 1–20, 1990, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/73989.