Group Scheduling with Learning Effect and Random Processing Time

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Dingyu Wang, Chunming Ye
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2021/6685149
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832546054064570368
author Dingyu Wang
Chunming Ye
author_facet Dingyu Wang
Chunming Ye
author_sort Dingyu Wang
collection DOAJ
description 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.
format Article
id doaj-art-45055f1f6e4a457bb53e08a6359ea45e
institution Kabale University
issn 2314-4629
2314-4785
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series Journal of Mathematics
spelling doaj-art-45055f1f6e4a457bb53e08a6359ea45e2025-02-03T07:24:01ZengWileyJournal of Mathematics2314-46292314-47852021-01-01202110.1155/2021/66851496685149Group Scheduling with Learning Effect and Random Processing TimeDingyu Wang0Chunming Ye1Business School, University of Shanghai for Science and Technology, Shanghai, ChinaBusiness School, University of Shanghai for Science and Technology, Shanghai, ChinaIn 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.http://dx.doi.org/10.1155/2021/6685149
spellingShingle Dingyu Wang
Chunming Ye
Group Scheduling with Learning Effect and Random Processing Time
Journal of Mathematics
title Group Scheduling with Learning Effect and Random Processing Time
title_full Group Scheduling with Learning Effect and Random Processing Time
title_fullStr Group Scheduling with Learning Effect and Random Processing Time
title_full_unstemmed Group Scheduling with Learning Effect and Random Processing Time
title_short Group Scheduling with Learning Effect and Random Processing Time
title_sort group scheduling with learning effect and random processing time
url http://dx.doi.org/10.1155/2021/6685149
work_keys_str_mv AT dingyuwang groupschedulingwithlearningeffectandrandomprocessingtime
AT chunmingye groupschedulingwithlearningeffectandrandomprocessingtime