Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times

Authors:
Viswanathan Kodaganallur;Anup K. Sen;Subrata Mitra
Affiliations:
Seton Hall University, 400 South Orange Avenue, NJ 07079, USA;Indian Institute of Management Calcutta, D.H. Road, Joka, Kolkata 700104, India;Indian Institute of Management Calcutta, D.H. Road, Joka, Kolkata 700104, India
Venue:
Computers and Industrial Engineering
Year:
2014

Citing 18
Cited 0

Minimizing mean squared deviation of completion times about a common due date

Management Science
The single machine problem with a quadratic cost function of completion times

Management Science
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

Computers and Operations Research
Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems

Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups

Computers and Industrial Engineering
TCBB Scheme: Applications to Single Machine Job Sequencing Problems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Computers and Operations Research
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

Computers and Operations Research
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

Computers and Operations Research
Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect

Computers and Industrial Engineering
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times

Computers and Operations Research
Criteria selection and analysis for single machine dynamic on-line scheduling with multiple objectives and sequence-dependent setups

Computers and Industrial Engineering
Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

Computers and Operations Research
A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times

Computers and Operations Research
Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times

Journal of Heuristics
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the single machine scheduling problem with quadratic penalties and sequence-dependent (QPSD) setup times. QPSD is known to be NP-Hard. Only a few exact approaches, and to the best of our knowledge, no approximate approaches, have been reported in the literature so far. This paper discusses exact and approximate approaches for solving the problem, and presents empirical findings. We make use of a graph search algorithm, Memory-Based Depth-First Branch-and-Bound (MDFBB), and present an algorithm, QPSD_MDFBB that can optimally solve QPSD, and advances the state of the art for finding exact solutions. For finding approximate solutions to large problem instances, we make use of the idea of greedy stochastic search, and present a greedy stochastic algorithm, QPSD_GSA that provides moderately good solutions very rapidly even for large problems. The major contribution of the current paper is to apply QPSD_GSA to generate a subset of the starting solutions for a new genetic algorithm, QPSD_GEN, which is shown to provide near-optimal solutions very quickly. Owing to its polynomial running time, QPSD_GEN can be used for much larger instances than QPSD_MDFBB can handle. Experimental results have been provided to demonstrate the performances of these algorithms.