ScholarLens Back to search
2009•Journal of Hebei Normal University of Science & TechnologyRequires access

A Scheduling Problem in Group Technology with Earliness Award and Tardiness Penalty

Hongli Zhu

Open publisher page 0 citations

Abstract

This paper considers a group processing and scheduling problem on a single machine.The objective is to minimize the sum of earliness award and tardiness penalty of all jobs.Optimal algorithms are provided and their complexity is also analyzed.

About this research paper

What this paper is about

This paper considers a group processing and scheduling problem on a single machine.The objective is to minimize the sum of earliness award and tardiness penalty of all jobs.Optimal algorithms are provided and their complexity is also analyzed.

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

This paper considers a group processing and scheduling problem on a single machine.The objective is to minimize the sum of earliness award and tardiness penalty of all jobs.Optimal algorithms are provided and their complexity is also analyzed.

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

Related papers

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