Minimizing Waiting Time of Jobs over Two Machines Scheduling Problems
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.
Published
2014-05-21
How to Cite
Bagga, P. (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
Section
Research Papers
Copyright (c) 2016 Defence Science Journal
Where otherwise noted, the Articles on this site are licensed under Creative Commons License: CC Attribution-Noncommercial-No Derivative Works 2.5 India