Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect

Authors:
Ji-Bo Wang;Lin-Hui Sun;Lin-Yan Sun
Affiliations:
School of Science, Shenyang Aerospace University, Shenyang 110136, China and The State Key Laboratory for Manufacturing Systems Engineering, Xi'an 710054, China and Knowledge Management & Innovati ...;School of Economics and Management, Xi'an University of Technology, Xi'an 710054, China and The State Key Laboratory for Manufacturing Systems Engineering, Xi'an 710054, China and The Key Laborato ...;School of Management, Xi'an Jiaotong University, Xi'an 710049, China and The State Key Laboratory for Manufacturing Systems Engineering, Xi'an 710054, China and The Key Laboratory of the Ministry ...
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 2
Cited 3

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation

Journal of Scheduling
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

Computers & Mathematics with Applications

Some single-machine scheduling problems with a truncation learning effect

Computers and Industrial Engineering
Some single-machine and flowshop scheduling problems with a non-linear deterioration function

Computers & Mathematics with Applications
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves

Computers and Industrial Engineering

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper we consider single-machine scheduling problems with an exponential sum-of-actual-processing-time-based learning effect. By the exponential sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is defined by an exponential function of the sum of the actual processing times of the already processed jobs. For the proposed learning model, we show that under certain conditions, the makespan minimization problem, the sum of the @qth (@q0) powers of completion times minimization problem, and some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem all remain polynomially solvable.