Scheduling target illuminators in naval battle‐group anti‐air warfare

Hanif D. Sherali, Youngho Lee, Donald D. Boyer

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)737-755
Number of pages19
JournalNaval Research Logistics Quarterly
Volume42
Issue number5
DOIs
Publication statusPublished - 1995
Externally publishedYes

Fingerprint

Military operations
Scheduling
Target
Heuristic algorithms
Processing
Missiles
Linear programming
Linear Programming Relaxation
Formulation
Job Scheduling
Flow Time
Availability
Missile
Assignment Problem
Unequal
Heuristic algorithm
Alternate
Scheduling Problem
Schedule
Integer

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Ocean Engineering
  • Modelling and Simulation

Cite this

Scheduling target illuminators in naval battle‐group anti‐air warfare. / Sherali, Hanif D.; Lee, Youngho; Boyer, Donald D.

In: Naval Research Logistics Quarterly, Vol. 42, No. 5, 1995, p. 737-755.

Research output: Contribution to journalArticle

Sherali, Hanif D. ; Lee, Youngho ; Boyer, Donald D. / Scheduling target illuminators in naval battle‐group anti‐air warfare. In: Naval Research Logistics Quarterly. 1995 ; Vol. 42, No. 5. pp. 737-755.
@article{e1d9a7cacf154a5bac5df0f066354587,
title = "Scheduling target illuminators in naval battle‐group anti‐air warfare",
abstract = "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. {\circledC} 1995 John Wiley & Sons, Inc.",
author = "Sherali, {Hanif D.} and Youngho Lee and Boyer, {Donald D.}",
year = "1995",
doi = "10.1002/1520-6750(199508)42:5<737::AID-NAV3220420503>3.0.CO;2-T",
language = "English",
volume = "42",
pages = "737--755",
journal = "Naval Research Logistics Quarterly",
issn = "0028-1441",
publisher = "John Wiley and Sons Inc.",
number = "5",

}

TY - JOUR

T1 - Scheduling target illuminators in naval battle‐group anti‐air warfare

AU - Sherali, Hanif D.

AU - Lee, Youngho

AU - Boyer, Donald D.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84977433884&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84977433884&partnerID=8YFLogxK

U2 - 10.1002/1520-6750(199508)42:5<737::AID-NAV3220420503>3.0.CO;2-T

DO - 10.1002/1520-6750(199508)42:5<737::AID-NAV3220420503>3.0.CO;2-T

M3 - Article

AN - SCOPUS:84977433884

VL - 42

SP - 737

EP - 755

JO - Naval Research Logistics Quarterly

JF - Naval Research Logistics Quarterly

SN - 0028-1441

IS - 5

ER -