On n/1/F̄ dynamic deterministic problems

Ramesh Chandra

Naval Research Logistics Quarterly, 1979, vol. 26, issue 3, 537-544

Abstract: We consider sequencing of n jobs which will arrive intermittently and are to be processed on a single machine; the arrival and the processing times of each jobs are assumed known. A schedule is to be developed that minimizes the mean flow time. Two models are considered: (i) when no pre‐emption or inserted idle time is allowed in the schedule, and (ii) when pre‐emption is allowed but the jobs follow a pre‐empt‐repeat discipline We illustrate that Cobham's and Phipp's SPT dispatching rule does not guarantee the optimum F̄ even for the non‐preemptive model We propose a branch and bound algorithm for both models and discuss our computational experience We also examine the relative performances of the optimum nonpre‐emptive sequence, and the optimum pre‐empt‐repeat sequence over that resulting from SPT dispatching rule on a large number of sets of jobs of varying sizes and tightness.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800260315

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:26:y:1979:i:3:p:537-544

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().