ScholarLens Back to search
2010•Journal of Xianyang Normal UniversityRequires access

A Scheduling Problem with Earliness Award and Tardiness Penalty

Yuan Li-hua

Open publisher page 0 citations

Abstract

In this paper,the scheduling problem with learning effect is considered.The objective function is to minimize the total earliness award and tardiness penalty.Several optimal algorithms are provided for the processing times of the jobs are non-identical and identical,respectively.

About this research paper

What this paper is about

In this paper,the scheduling problem with learning effect is considered.The objective function is to minimize the total earliness award and tardiness penalty.Several optimal algorithms are provided for the processing times of the jobs are non-identical and identical,respectively.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper,the scheduling problem with learning effect is considered.The objective function is to minimize the total earliness award and tardiness penalty.Several optimal algorithms are provided for the processing times of the jobs are non-identical and identical,respectively.

Key concepts: Tardiness, Scheduling (production processes), Mathematical optimization, Due date, Computer science, Penalty method, Job shop scheduling, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Scheduling Problem with Earliness Award and Tardiness Penalty — Research Paper | ScholarLens