Metaheuristics for late work minimization in two-machine flow shop with common due date

Authors:
Jacek Blazewicz;Erwin Pesch;Malgorzata Sterna;Frank Werner
Affiliations:
Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Information Systems, FB 5 – Faculty of Economics, University of Siegen, Siegen, Germany;Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Faculty of Mathematics, Otto-von-Guericke-University, Magdeburg, Germany
Venue:
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Year:
2005

Citing 10
Cited 1

Minimizing mean weighted execution time loss on identical and uniform processors

Information Processing Letters
Single machine scheduling to minimize total late work

Operations Research
TSP ejection chains

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Scheduling Algorithms

Scheduling Algorithms
Tabu Search

Tabu Search
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
Local Search in Combinatorial Optimization

Artificial Neural Networks: An Introduction to ANN Theory and Practice
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Open shop scheduling problems with late work criteria

Discrete Applied Mathematics
Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Late work minimization in a small flexible manufacturing system

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, metaheuristic approaches for the weighted late work minimization in the two-machine flow shop problem with a common due date (F2 | dj=d | Yw) are presented. The late work performance measure estimates the quality of a solution with regard to the duration of the late parts of jobs not taking into account the quantity of the delay for the fully late activities. Since, the problem mentioned is known to be NP-hard, three trajectory based methods, namely simulated annealing, tabu search and variable neighborhood search were designed and compared to an exact approach and a list scheduling algorithm.