Yu Ying
Abstract
This paper considers a group scheduling problem with learning effect on a single machine.The objective is to minimize the sum of earlyness award and tardiness penalty of all jobs.Optimal algorithm are provided and their complexity is also analyzed for three special circumstances.
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.
This paper considers a group scheduling problem with learning effect on a single machine.The objective is to minimize the sum of earlyness award and tardiness penalty of all jobs.Optimal algorithm are provided and their complexity is also analyzed for three special circumstances.
Key concepts: Tardiness, Computer science, Mathematical optimization, Single-machine scheduling, Scheduling (production processes), Job shop scheduling, Distributed computing, Mathematics