Simple heuristics for the single machine minimum variance scheduling problem
Source
The Arabian Journal for Science and Engineering. Section B, Engineering
Issue
Vol. 26, Issue 2B (31 Oct. 2001), pp.127-132, 6 p.
Publisher
King Fahd University of Petroleum and Minerals
Publication Date
2001-10-31
Country of Publication
Saudi Arabia
No. of Pages
6
Main Subjects
Abstract EN
Consider a number of jobs to be processed by a single machine.
It is required to put thesejobs in order so that the variat،on betweenjobs completion times is minimized.
This problem is known to be computationally hard.
In this paper several heuristics are developed and compared to each other and one of them is identified to out perform the others.
The developed heuristics can be used in situations where fast and simple solutions with acceptable level of quality are needed.
-
American Psychological Association (APA)
al-Turki, Umar. 2001. Simple heuristics for the single machine minimum variance scheduling problem. The Arabian Journal for Science and Engineering. Section B, Engineering،Vol. 26, no. 2B, pp.127-132.
https://search.emarefa.net/detail/BIM-389436
Modern Language Association (MLA)
al-Turki, Umar. Simple heuristics for the single machine minimum variance scheduling problem. The Arabian Journal for Science and Engineering. Section B, Engineering Vol. 26, no. 2B (Oct. 2001), pp.127-132.
https://search.emarefa.net/detail/BIM-389436
American Medical Association (AMA)
al-Turki, Umar. Simple heuristics for the single machine minimum variance scheduling problem. The Arabian Journal for Science and Engineering. Section B, Engineering. 2001. Vol. 26, no. 2B, pp.127-132.
https://search.emarefa.net/detail/BIM-389436
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 132
Record ID
BIM-389436
