Group Scheduling with Learning Effect and Random Processing Time | Zendy

Dingyu Wang | Zendy; Chunming Ye | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Group Scheduling with Learning Effect and Random Processing Time

Author(s) -

Dingyu Wang,

Chunming Ye

Publication year - 2021

Publication title -

journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 13

eISSN - 2314-4785

pISSN - 2314-4629

DOI - 10.1155/2021/6685149

Subject(s) - scheduling (production processes) , mathematics , group (periodic table) , mathematical optimization , schedule , heuristic , learning effect , random variable , computer science , statistics , chemistry , organic chemistry , economics , microeconomics , operating system

In this paper, we establish a stochastic grouping scheduling model. In the model, there is no installation time between the jobs in the same group, but each group has an installation time before processing. There are learning effects between groups and within groups, and the completion time of jobs is a random variable. We take the long expected schedule and the expected total completion time as the objective function, and the noninterruptible static priority strategy is obtained. At the same time, heuristic algorithms and examples are given.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research