Minimizing Waiting Time of Jobs over Two Machines Scheduling Problems

Authors

  • P. C. Bagga Defence Science Laboratory, Delhi

DOI:

https://doi.org/10.14429/dsj.17.7374

Keywords:

Algorithm, Waiting Time, Scheduling Problems

Abstract

In certain cases, significant costs are incurred, if there is a waiting time of the jobs. An algorithm which yields an optimum sequence of n jobs, is obtained and is illustrated with an example.

Downloads

Published

2014-05-21

How to Cite

Bagga, P. C. (2014). Minimizing Waiting Time of Jobs over Two Machines Scheduling Problems. Defence Science Journal, 17(2), 67–78. https://doi.org/10.14429/dsj.17.7374

Issue

Vol. 17 No. 2

Section

Research Papers

License

 Where otherwise noted, the Articles on this site are licensed under Creative Commons License: CC Attribution-Noncommercial-No Derivative Works 2.5 India