Group scheduling with general autonomous and induced learning effect

DOI10.1155/2018/2172378MaRDI QIDQ1720558zbMATH OpenOpenAlexFDO

Authors Jiazhen Huo, Lei Ning, Li Sun

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2018/2172378

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Review text

Summary: In recent research, induced learning requires management involvement. The initial investment can be interpreted as induced learning via an investment in the creation of technological knowledge or knowledge transfer. Induced learning has received attention in productivity improvement. In this paper, we consider scheduling problems with autonomous and induced learning under group technology. The jobs' processing times decrease according to a learning rate which conversely increases the investment cost. The objectives of the scheduling problems are to minimize a linear combination of the makespan and the investment cost and a linear combination of the total completion time and the investment cost. We present polynomial algorithms to determine the optimal job sequence, group sequence, and the percentage reduction of the standard learning rate.

Recommendations

• Common due date scheduling with autonomous and induced learning
• A state-of-the-art review on scheduling with learning effects
• Single-machine group scheduling with a time-dependent learning effect
• Single-machine group scheduling problems with the sum-of-processing-time based on learning effect
• A note on single-machine group scheduling problem with a general learning function

Cites work

• A note on single-machine group scheduling problems with position-based learning effect
• Common due date scheduling with autonomous and induced learning
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
• Flowshop scheduling with a general exponential learning effect
• Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
• Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• On single processor scheduling problems with learning dependent on the number of processed jobs
• Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect
• Scheduling on parallel processors with varying processing times
• Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
• Single machine scheduling with learning effect considerations
• Single-machine group scheduling with general deterioration and learning effects
• Single-machine scheduling with learning considerations
• Single-machine scheduling with two competing agents and learning consideration

Cited in

(2)

• Common due date scheduling with autonomous and induced learning
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process

This page was built for publication: Group scheduling with general autonomous and induced learning effect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1720558)