Scheduling under the Due Date Criterion with Varying Penalties for Lateness
Yugoslav journal of operations research, Tome 3 (1993) no. 2, p. 189
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The problem of scheduling jobs in a single machine with due dates being
assigned using the CON and SLK due date determination methods, is examined.
Different penalties for the early and tardy jobs are assumed. The penalties are job-dependent,
proportional to the processing times of jobs raised to an integer, non-unit,
positive power. The objective function is the total weighted lateness. Two algorithms
providing the optimal sequences are presented and examples illustrating the use of t he
algorithms are given.
Keywords:
Due date, weighted lateness, CON method, SLK method, scheduling
@article{YJOR_1993_3_2_a3,
author = {Costas P.Pappis and G. I. Adamopulos},
title = {Scheduling under the {Due} {Date} {Criterion} with {Varying} {Penalties} for {Lateness}},
journal = {Yugoslav journal of operations research},
pages = {189 },
year = {1993},
volume = {3},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1993_3_2_a3/}
}
TY - JOUR AU - Costas P.Pappis AU - G. I. Adamopulos TI - Scheduling under the Due Date Criterion with Varying Penalties for Lateness JO - Yugoslav journal of operations research PY - 1993 SP - 189 VL - 3 IS - 2 UR - http://geodesic.mathdoc.fr/item/YJOR_1993_3_2_a3/ LA - en ID - YJOR_1993_3_2_a3 ER -
Costas P.Pappis; G. I. Adamopulos. Scheduling under the Due Date Criterion with Varying Penalties for Lateness. Yugoslav journal of operations research, Tome 3 (1993) no. 2, p. 189 . http://geodesic.mathdoc.fr/item/YJOR_1993_3_2_a3/