Premium
Scheduling target illuminators in naval battle‐group anti‐air warfare
Author(s) -
Sherali Hanif D.,
Lee Youngho,
Boyer Donald D.
Publication year - 1995
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199508)42:5<737::aid-nav3220420503>3.0.co;2-t
Subject(s) - computer science , exploit , scheduling (production processes) , navy , operations research , integer programming , downtime , mathematical optimization , real time computing , algorithm , engineering , computer security , mathematics , archaeology , history , operating system
We schedule a set of illuminators (homing devices) to strike a set of targets using surface‐to‐air missiles in a naval battle. The task is viewed as a production floor shop scheduling problem of minimizing the total weighted flow time, subject to time‐window job availability and machine downtime side constraints. A simple algorithm based on solving assignment problems is developed for the case when all the job processing times are equal and the data are all integer. For the general case of scheduling jobs with unequal processing times, we develop two alternate formulations and analyze their relative strengths by comparing their respective linear programming relaxations. We select the better formulation in this comparison and exploit its special structures to develop several effective heuristic algorithms that provide good‐quality solutions in real time; this is an essential element for use by the Navy. © 1995 John Wiley & Sons, Inc.