MINIMIZING THE NUMBER OF TARDY JOBS IN IDENTICAL MACHINE SCHEDULING

Authors
SUER GA BAEZ E CZAJKIEWICZ Z
Citation
Ga. Suer et al., MINIMIZING THE NUMBER OF TARDY JOBS IN IDENTICAL MACHINE SCHEDULING, Computers & industrial engineering, 25(1-4), 1993, pp. 243-246
Citations number
5
Categorie Soggetti
Computer Application, Chemistry & Engineering",Engineering,"Computer Applications & Cybernetics
Journal title
Computers & industrial engineering → ACNP
ISSN journal
03608352
Volume
25
Issue
1-4
Year of publication
1993
Pages
243 - 246
Database
ISI
SICI code
0360-8352(1993)25:1-4<243:MTNOTJ>2.0.ZU;2-A
Abstract
In this paper, minimizing the number of tardy jobs in identical parall el machine scheduling is discussed. First, an integer programming form ulation is given. Later, three simple heuristic procedures are present ed with an example. Finally, the performance of the proposed heuristic procedures is compared with other available procedures.