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

Authors:
M. Duran Toksari;Ertan Güner
Affiliations:
Erciyes University, Engineering Faculty, Industrial Engineering Department, Kayseri, Turkey;Gazi University, Engineering and Architecture Faculty, Industrial Engineering Department, Ankara, Turkey
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 13
Cited 10

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Weighted-tardiness scheduling on parallel machines with proportional weights

Operations Research
V-shaped policies for scheduling deteriorating jobs

Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach

Computers and Industrial Engineering
Parallel machine earliness and tardiness scheduling with proportional weights

Computers and Operations Research
Single-machine group scheduling with a time-dependent learning effect

Computers and Operations Research
Flow shop scheduling problems with decreasing linear deterioration under dominant machines

Computers and Operations Research
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
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

Mathematical and Computer Modelling: An International Journal

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

Computers and Industrial Engineering
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
A note on the learning effect in multi-agent optimization

Expert Systems with Applications: An International Journal
A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

Computers and Operations Research
Short Communication: Notes on "The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration"

Expert Systems with Applications: An International Journal
Single-machine makespan minimization scheduling with nonlinear shortening processing times

Computers and Operations Research
Short Communication: Reply to note on The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration

Expert Systems with Applications: An International Journal
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
The solution algorithms for the multiprocessor scheduling with workspan criterion

Expert Systems with Applications: An International Journal
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

Computers and Operations Research

Quantified Score

Hi-index	12.06

Visualization

Abstract

This paper considers earliness/tardiness (ET) scheduling problem on a parallel machine environment with common due-date under the effects of time-dependent learning and linear and nonlinear deterioration. In this paper, the effects of learning and deterioration are considered 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. This study shows that optimal solution for ET scheduling problem under effects of learning and deterioration is V-shape schedule under certain agreeable conditions. Furthermore, we present a mathematical model for the problem under study and an algorithm for solving large test problems. The algorithm can solve problems of 1000 jobs and four machines within 3s on average.