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

Authors:
M. Duran Toksarı;Ertan Güner
Affiliations:
Industrial Engineering Department, Engineering Faculty, Erciyes University, Kayseri, Turkey;Industrial Engineering Department, Engineering and Architecture Faculty, Gazi University, Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2009

Citing 13
Cited 9

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
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

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
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

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
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect

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

Information Sciences: 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
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

Computers and Operations Research
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves

Computers and Industrial Engineering
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

Computers and Operations Research
A multi-agent system for the weighted earliness tardiness parallel machine problem

Computers and Operations Research
Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a parallel machine earliness/tardiness (ET) scheduling problem with different penalties under the effects of position based learning and linear and nonlinear deterioration. The problem has common due-date for all jobs, and effects of learning and deterioration are considered simultaneously. By the effects of learning we mean that the job processing time decreases along the sequence of partly similar jobs, and by the effects of deterioration we mean slowing performance or time increases along the sequence of jobs. 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 design a mathematical model for the problem under study and algorithm and lower bound procedure to solve larger test problems. The algorithm can solve problems of 1000 jobs and four machines within 3s on average. The performance of the algorithm is evaluated using results of the mathematical model.