Exponential neighborhood search for a parallel machine scheduling problem

Authors:
Y. A. Rios-Solis;F. Sourd
Affiliations:
LIP6-University of Paris VI, 4 Place Jussieu, 75252 Paris Cedex 05, France;LIP6-University of Paris VI, 4 Place Jussieu, 75252 Paris Cedex 05, France
Venue:
Computers and Operations Research
Year:
2008

Citing 17
Cited 2

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date

Computers and Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights

Computers and Industrial Engineering
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Computers and Operations Research
Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Parallel machine earliness and tardiness scheduling with proportional weights

Computers and Operations Research
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem

INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties

Computers and Operations Research
Scheduling Algorithms

Scheduling Algorithms
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

Operations Research Letters
Equivalence of mean flow time problems and mean absolute deviation problems

Operations Research Letters

Scheduling technicians and tasks in a telecommunications company

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

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a restrictive common due date. This problem is NP-hard in the strong sense. In this paper we define an exponential size neighborhood for this problem and prove that finding the local minimum in it is an NP-hard problem. The main contribution of this paper is to propose a pseudo-polynomial algorithm that finds the best solution of the exponential neighborhood. Additionally, we present some computational results.