Multi-criteria Constrained Scheduling Problems with Lateness or Tardiness as the First Criterion
Liang Tian-juan
Abstract
Liang Tian-juan
Abstract
Scheduling problems with multiple objectives play increasing important roles in solving complicated problems appearing in the fields of economy,management,engineering,military affairs and society etc.In 1956 Smith made a deep research onperfectscheduling,which is to find the minimal average completion time without tardiness jobs.However,tardiness is allowed in practice,in other words,a job may be finished after the due date,and it has just different requirements for different problems.This paper studies 4 problems with the fast objective as lateness or tardiness to minimize the average completion time subject to that the maximum lateness L_(max),the total lateness∑L_j,the maximum tardiness T_(max) or the total tardiness∑T_j is not exceeded a given quantities respectively.The algorithms for them are proposed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Scheduling problems with multiple objectives play increasing important roles in solving complicated problems appearing in the fields of economy,management,engineering,military affairs and society etc.In 1956 Smith made a deep research onperfectscheduling,which is to find the minimal average completion time without tardiness jobs.However,tardiness is allowed in practice,in other words,a job may be finished after the due date,and it has just different requirements for different problems.This paper studies 4 problems with the fast objective as lateness or tardiness to minimize the average completion time subject to that the maximum lateness L_(max),the total lateness∑L_j,the maximum tardiness T_(max) or the total tardiness∑T_j is not exceeded a given quantities respectively.The algorithms for them are proposed.
Key concepts: Tardiness, Scheduling (production processes), Retard, Due date, Mathematical optimization, Computer science, Job shop scheduling, Operations research