Group scheduling with learning effect and random processing time
Summary: 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.
- Single-machine group scheduling problems with the sum-of-processing-time based on learning effect
- Single machine group scheduling with learning effects and past-sequence-dependent setup times
- Single-machine group scheduling with a time-dependent learning effect
- A note on single-machine group scheduling problems with position-based learning effect
- Single-machine group scheduling with general deterioration and learning effects
- A bi-criterion single-machine scheduling problem with learning considerations
- A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects
- A note on single-machine group scheduling problems with position-based learning effect
- A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
- An order scheduling problem with position-based learning effect
- Complexity results for single-machine scheduling with positional learning effects
- scientific article; zbMATH DE number 2119001 (Why is no real title available?)
- Learning and forgetting effects on a group scheduling problem
- Minimizing total tardiness in a scheduling problem with a learning effect
- Note on scheduling with general learning curves to minimize the number of tardy jobs
- Parallel machine scheduling with a learning effect
- Piecewise linear model for multiskilled workforce scheduling problems considering learning effect and project quality
- Scheduling jobs with position-dependent processing times
- Scheduling problems with a learning effect
- Scheduling with general job-dependent learning curves.
- Single-machine group scheduling problems with deteriorated and learning effect
- Single-machine group scheduling problems with deteriorating and learning effect
- Single-machine scheduling problems with a sum-of-processing-time-based learning function
- Single-machine scheduling with learning considerations
- Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
This page was built for publication: Group scheduling with learning effect and random processing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240193)
