A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

Authors:
Ali Allahverdi
Affiliations:
Department of Industrial and Management Systems Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait
Venue:
Computers and Operations Research
Year:
2004

Citing 4
Cited 5

Job lateness in a two-machine flowshop with setup times separated

Computers and Operations Research
A heuristic algorithm for mean flowtime objective in flowshop scheduling

Computers and Operations Research
Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell

Computers and Industrial Engineering
Tabu search for total tardiness minimization in flowshop scheduling problems

Computers and Operations Research

Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

Data & Knowledge Engineering
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness

Computers and Operations Research
Minimizing total flow time in permutation flow shop scheduling with improved simulated annealing

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

Computers and Operations Research
Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries

Information Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the m-machine flowshop problem with the objective of minimizing a weighted sum of makespan and maximum tardiness. Two types of the problem are addressed. The first type is to minimize the objective function subject to the constraint that the maximum tardiness should be less than a given value. The second type is to minimize the objective without the constraint. A new heuristic is proposed and compared to two existing heuristics. Computational experiments indicate that the proposed heuristic is much better than the existing ones. Moreover, a dominance relation and a lower bound are developed for a three-machine problem. The dominance relation is shown to be quite efficient.