Hierarchical minimization of completion time variance and makespan in jobshops

Authors:
Viswanath Kumar Ganesan;Appa Iyer Sivakumar;G. Srinivasan
Affiliations:
Singapore-MIT Alliance, Nanyang Technological University, Singapore, Singapore;Systems and Engineering Management Division, School of Mechanical and Production Engineering, Nanyang Technological University, Singapore, Singapore;Industrial Management Division, Department of Humanities and Social Sciences, Indian Institute of Technology, Madras, India
Venue:
Computers and Operations Research
Year:
2006

Citing 14
Cited 2

Deterministic and random single machine sequencing with variance minimization

Operations Research
The shifting bottleneck procedure for job shop scheduling

Management Science
Simultaneous minimization of mean and variation flow time and waiting in single machine systems

Operations Research
Job shop scheduling by simulated annealing

Operations Research
On the minimization of completion time variance with a bicriteria extension

Operations Research
New search spaces for sequencing problems with application to job shop scheduling

Management Science
A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions

Computers and Operations Research
A backward approach in list scheduling algorithms for multi-machine tardiness problems

Computers and Operations Research
Minimizing single-machine completion time variance

Management Science
Heuristics for multimachine scheduling problems with earliness and tardiness costs

Management Science
Algorithms to minimize completion time variance in a two machine flowshop

Proceedings of the 23rd international conference on on Computers and industrial engineering
Genetic Algorithms

Genetic Algorithms
A branch and bound algorithm to minimize completion time variance on a single processor

Computers and Operations Research
On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Operations Research Letters

Using simulation based approach to improve on the mean cycle time performance of dispatching rules

WSC '05 Proceedings of the 37th conference on Winter simulation
A bee colony optimization algorithm to job shop scheduling

Proceedings of the 38th conference on Winter simulation

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the problem of minimizing makespan for a given set of n jobs to be processed on each of m machines in a static jobshop, subject to the minimum completion time variance (CTV). A lower bound on CTV is developed for the static jobshop problem. A backward scheduling approach is proposed using the observations on the development of lower bound for hierarchical minimization of CTV and makespan. A lower bound on makespan subject to minimum CTV is also presented for this problem. Finally, we present two simulated annealing heuristic approaches using the concepts of forward and backward scheduling. Their performances are compared against each other through the use of the lower bounds established in this work. The simulated annealing heuristic based on backward scheduling is shown to perform well by evaluating the developed heuristics on 82 jobshop problems taken from literature.