Minimizing the weighted number of tardy jobs on a two-machine flow shop

Authors:
R. L. Bulfin;Rym M'Hallah
Affiliations:
Department of Industrial and Systems Engineering, Auburn University, 207, Dunstan Hall, Auburn, AL;Department of Quantitative Methods, Institut Superieur de Gestion de Sousse, B.P. 763 Sousse 4000, Tunisia
Venue:
Computers and Operations Research
Year:
2003

Citing 2
Cited 6

Discrete optimization

Discrete optimization
Flowshop scheduling with dominant machines

Computers and Operations Research

Maximizing the weighted number of just-in-time jobs in flow shop scheduling

Journal of Scheduling
A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem

Information Sciences: an International Journal
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

Computers and Operations Research
Minimizing the number of tardy jobs under piecewise-linear deterioration

Computers and Industrial Engineering
Scheduling linear deteriorating jobs to minimize the number of tardy jobs

Journal of Global Optimization
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we describe an exact algorithm to solve the weighted number of tardy jobs two-machine flow shop scheduling problem. The algorithm uses branch-and-bound; a surrogate relaxation resulting in a multiple-choice knapsack provides the bounds. Extensive computational experiments indicate problems with 100 jobs can be solved quickly.