Heuristic methods for the identical parallel machine flowtime problem with set-up times

Authors:
Simon Dunstall;Andrew Wirth
Affiliations:
CSIRO Mathematical and Information Sciences, Private Bag 10, Clayton South MDC 3169, Australia;Department of Mechanical and Manufacturing Engineering, University of Melbourne, 3010, Australia
Venue:
Computers and Operations Research
Year:
2005

Citing 5
Cited 5

A better heuristic for preemptive parallel machine scheduling with batch setup times

SIAM Journal on Computing
Analysis of heuristics for preemptive parallel machine scheduling with batch setup times

Operations Research
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Dynamic programming algorithms for scheduling parallel machines with family setup times

Computers and Operations Research
The complexity of scheduling job families about a common due date

Operations Research Letters

Planning production using mathematical programming: The case of a woodturning company

Computers and Operations Research
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times

Applied Soft Computing
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing
A genetic algorithm-based scheduler for multiproduct parallel machine sheet metal job shop

Expert Systems with Applications: An International Journal
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the scheduling of N jobs divided into G families for processing on M identical parallel machines. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i ≠ j, the duration of this set-up being the sequence-independent set-up time sj for family j. We propose heuristics for this problem and computationally evaluate the performance of the heuristics relative to lower bounds and solutions obtained using an exact algorithm.