Minimizing mean weighted execution time loss on identical and uniform processors
Information Processing Letters
Minimizing the number of tardy job units under release time constraints
Discrete Applied Mathematics - Combinatorial Optimization
Single machine scheduling to minimize total late work
Operations Research
Minimizing the weighted number of tardy task units
Discrete Applied Mathematics
Scheduling Algorithms
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
Computers and Industrial Engineering
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Open shop scheduling problems with late work criteria
Discrete Applied Mathematics
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
Computers and Industrial Engineering
Approximation algorithms for scheduling a single machine to minimize total late work
Operations Research Letters
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
Computers and Operations Research
Late work minimization in flow shops by a genetic algorithm
Computers and Industrial Engineering
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
Computers and Operations Research
| Hi-index | 0.01 |
In this paper, metaheuristic approaches for the two-machine flow-shop problem with a common due date and the weighted late work performance measure (F2|d"j=d|Y"w) are presented. The late work criterion 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 methods, namely simulated annealing, tabu search and variable neighborhood search are proposed based on the special features of the case under consideration. Then, the results of computational experiments are reported, in which the metaheuristics were compared one to each other, as well to an exact approach and a list scheduling algorithm.