Algorithms for parallel machine scheduling: A case study of the tracking and data relay satellite system

Journal of the Operational Research Society

Volumn 54, Issue 8, 2003, Pages 806-821

  Rojanasoonthon, S ^a   Bard, J F ^a   Reddy, S D ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b Computer Sciences Corporation ^*  (United States)

Author keywords

Dynamic programming; GRASP; Heuristics; Job priorities; Parallel machine scheduling; Range scheduling

Indexed keywords

ADAPTIVE ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; INTEGER PROGRAMMING; JOB ANALYSIS; LINEAR PROGRAMMING; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES; SATELLITE COMMUNICATION SYSTEMS; SATELLITE GROUND STATIONS; SATELLITE RELAY SYSTEMS; SCHEDULING;

ADAPTIVE SEARCH PROCEDURE; JOB PRIORITIES; PARALLEL MACHINE SCHEDULING;

PARALLEL ALGORITHMS;

EID: 0043246004     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601575     Document Type: Article

References (21)

1. Arbabi M (1984). Range scheduling automation. IBM Technical Directions 10: 57-62.
2. Arbabi M and Pfeifer M (1987). Range and mission scheduling automation using combined AI and operations research techniques. In: Griffin S (ed). First Annual Workshop on Space Operations Automation and Robotics (SOAR '87): NASA Conference Publication 2491. Washington. DC, pp 315-320.
3. Reddy SC and Brown WL. Single processor scheduling with job priorities and arbitrary ready and due times. Working paper, October 1986, Computer Sciences Corporation. Beltsville, MD.
4. Cheng TCE and Sin CCS (1990). A state-of-the-art review of parallel-machine scheduling research. Eur J Opl Res 47: 271-292.
5. Gensch DD (1978). An industrial application of the traveling salesman's subtour problem. AIIE Trans 10: 362-370.
6. Butt SE and Cavalier TM (1994). A heuristic for the multiple tour maximum collection problem. Comput Opns Res 21: 101-111.
7. Kataoka S and Morito S. (1988). An algorithm for single constraint maximum collection problem. J Opns Res Soc Japan 31: 515-530.
8. Golden BL, Levy L and Dahl R (1981). Two generalizations of the traveling salesman problem. Omega 8: 439-441.
9. Balas E (1989). The prize collecting traveling salesman problem. Networks 19: 621-636.
10. Golden BL, Levy L and Vohra R (1987). The orienteering problem. Nav Res Logist Q 307-318.
11. Reddy SD (1988). Scheduling of tracking and data relay satellite system (TDRSS) antennas: scheduling with sequence dependent setup times. Presented at ORSA/TIMS Joint National Meeting, Denver, CO.
12. Gabrel, V (1995). Scheduling jobs within time windows on identical parallel machines: new model and algorithms. Eur J Opl Res 83: 320-329.
13. Randhawa SU and Kuo CH (1997). Evaluating scheduling heuristics for non-identical parallel processors. Int J Prod Res 35: 969-981.
14. Tsiligirides T (1984). Heuristic methods applied to orienteering. J Opl Res Soc 35: 797-809.
15. Laporte G and Martello S (1990). The selective traveling salesman problem. Discrete Appl Math 26: 193-207.
16. Ramesh R and Brown KM (1991). An efficient four-phase heuristic for the generalized orienteering problem. Comput Opns Res 18: 151-165.
17. Ramesh R. Yoon YS and Karwan MH (1992). An optimal algorithm for the orienteering tour problem. ORSA J Comput 4: 155-165.
18. Kantor MG and Rosenwein MB (1992). The orienteering problem with time windows. J Opl Res Soc 43: 629-635.
19. Feo TA and Resende MGC (1995). Greedy randomized adaptive search procedures. J Glob Optimiz 6: 109-133.
20. Rojanasoonthon S and Bard JF (2001). A grasp for parallel machine scheduling with time windows. Working Paper, 2001, Graduate Program in Operations Research. University of Texas, Austin, TX.
21. Or I. Traveling salesmen-type combinatorial problems and their relation to the logistics of blood banking. PhD thesis, 1976.