IDENTICAL MACHINE SCHEDULING TO MINIMIZE THE NUMBER OF TARDY JOBS WHEN LOT-SPLITTING IS ALLOWED

Authors
SUER GA PICO F SANTIAGO A
Citation
Ga. Suer et al., IDENTICAL MACHINE SCHEDULING TO MINIMIZE THE NUMBER OF TARDY JOBS WHEN LOT-SPLITTING IS ALLOWED, Computers & industrial engineering, 33(1-2), 1997, pp. 277-280
Citations number
6
Journal title
Computers & industrial engineering → ACNP
ISSN journal
03608352
Volume
33
Issue
1-2
Year of publication
1997
Pages
277 - 280
Database
ISI
SICI code
0360-8352(1997)33:1-2<277:IMSTMT>2.0.ZU;2-5
Abstract
In this paper, minimizing the number of tardy jobs in identical parall el machine scheduling is discussed. Four mathematical modeling formula tions are presented to consider setup times and lot-splitting decision s. The results of the experimentation are presented and concluding rem arks are made. (C) 1997 Elsevier Science Ltd.