One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy

One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy. PRODUCTION PLANNING CONTROL, 8. pp. 226-230.

[img]
Preview
PDF (A research paper on : One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy)
one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf

Download (25kB) | Preview

Abstract

In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal.

Item Type: Article
Subjects: Systems
Department: College of Computing and Mathematics > lndustrial and Systems Engineering
Depositing User: SYED AMEENUDDIN HUSSAIN
Date Deposited: 10 Jun 2008 08:38
Last Modified: 01 Nov 2019 13:30
URI: https://eprints.kfupm.edu.sa/id/eprint/1990