A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

Authors:
M. Duran Toksarı
Affiliations:
Erciyes University, Engineering Faculty, Industrial Engineering Department, Kayseri, Turkey
Venue:
Computers and Operations Research
Year:
2011

Citing 16
Cited 4

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
V-shaped policies for scheduling deteriorating jobs

Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
A learning curve primer for software engineers

ACM SIGSOFT Software Engineering Notes
Some scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration

Computers and Operations Research
Two-machine flow shop problem with effects of deterioration and learning

Computers and Industrial Engineering
Single-machine scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration

Expert Systems with Applications: An International Journal
Single-machine scheduling with learning effect and deteriorating jobs

Computers and Industrial Engineering
Single machine scheduling with time-dependent deterioration and exponential learning effect

Computers and Industrial Engineering
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect

Computers and Industrial Engineering
Minimizing the makespan on a single machine with learning and unequal release times

Computers and Industrial Engineering
Some single-machine scheduling problems with general effects of learning and deterioration

Computers & Mathematics with Applications
Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

Journal of Intelligent Manufacturing
Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning

Mathematical and Computer Modelling: An International Journal

Solving a two-agent single-machine scheduling problem considering learning effect

Computers and Operations Research
Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects

Computers and Industrial Engineering
Joint reply to the erratum and the note on "Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning" [Math. Comput. Modelling 50 (2009) 401-406]

Mathematical and Computer Modelling: An International Journal
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a single-machine problem with the unequal release times under learning effect and deteriorating jobs when the objective is minimizing the makespan. In this study, we introduced a scheduling model with unequal release times in which both job deterioration and learning exist simultaneously. By the effects of learning and deterioration, we mean that the processing time of a job is defined by increasing function of its execution start time and position in the sequence. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A heuristic algorithm is proposed to obtain a near-optimal solution. The computational experiments show that the branch-and-bound algorithm can solve instances up to 30 jobs, and the average error percentage of the proposed heuristic is less than 0.16%.