Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects

Authors:
Alex J. Ruiz-Torres;Giuseppe Paletta;Eduardo PéRez
Affiliations:
Facultad de Administración de Empresas, Universidad de Puerto Rico-Río Piedras, San Juan, PR 00931-3332, USA;Dipartimento di Economia e Statistica, Universita' della Calabria (UNICAL), 87036 Rende, CS, Italy;Ingram School of Engineering, Texas State University, 601 University Drive San Marcos, TX 78666, USA
Venue:
Computers and Operations Research
Year:
2013

Citing 9
Cited 1

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Parallel-machine scheduling with time dependent processing times

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

Computers and Operations Research
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations

Information Sciences: an International Journal
Parallel-machine scheduling of simple linear deteriorating jobs

Theoretical Computer Science
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
Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time

Information Sciences: an International Journal
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities

Computers and Operations Research

A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A new unrelated parallel machine scheduling problem with deteriorating effect and the objective of makespan minimization is presented in this paper. The deterioration of each machine (and therefore of the job processing times) is a function of the sequence of jobs that have been processed by the machine and not (as considered in the literature) by the time at which each job is assigned to the machine or by the number of jobs already processed by the machine. It is showed that for a single machine the problem can be solved in polynomial time, whereas the problem is NP-hard when the number of machines is greater or equal than two. For the last case, a set of list scheduling algorithms and simulated annealing meta-heuristics are designed and the effectiveness of these approaches is evaluated by solving a large number of benchmark instances.