Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

Authors:
J. Bank;F. Werner
Affiliations:
Otto-von-Guericke-Universität Magdeburg, PSF 4120 39016 Magdeburg, Germany;Otto-von-Guericke-Universität Magdeburg, PSF 4120 39016 Magdeburg, Germany
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2001

Citing 12
Cited 15

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines

Annals of Operations Research
Scheduling about a common due date with earliness and tardiness penalties

Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
Scheduling parallel machines to minimize total weighted and unweighted tardiness

Computers and Operations Research
Parallel machine scheduling with earliness and tardiness penalties

Computers and Operations Research
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness

Journal of Heuristics
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Mathematical and Computer Modelling: An International Journal
Equivalence of mean flow time problems and mean absolute deviation problems

Operations Research Letters

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

Computers and Operations Research
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
A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint

Computers and Industrial Engineering
Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

Journal of Intelligent Manufacturing
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing
Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints

Computers and Operations Research
Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning

Computers and Operations Research
A Strategy to Improve Resource Utilization in Grids Based on Network-Aware Meta-scheduling in Advance

GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
A new inter-island genetic operator for optimization problems with block properties

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal
Improving Grid Resource Usage: Metrics for Measuring Fragmentation

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
On the Improvement of Grid Resource Utilization: Preventive and Reactive Rescheduling Approaches

Journal of Grid Computing
A multi-agent system for the weighted earliness tardiness parallel machine problem

Computers and Operations Research
A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines--part II: enhancements and experimentations

Journal of Intelligent Manufacturing
Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper considers a scheduling problem where each of n jobs has to be processed without interruption on exactly one of m unrelated parallel machines. For each job, a release date and the processing times on each machine are given, and a common due date d is given for all jobs. The objective is to distribute the jobs to the machines and to schedule the jobs assigned to each machine such that the weighted sum of linear earliness and tardiness penalties is minimal. For this problem, we derive some structural properties useful in connection with the search for an approximate solution. Furthermore, we present various constructive and iterative heuristic algorithms which are compared on problems with up to 500 jobs and 20 machines.