Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

Authors:
Alex J. Ruiz-Torres;José H. Ablanedo-Rosas;Johnny C. Ho
Affiliations:
Departamento de Gerencia, Facultad de Administración de Empresas, Universidad de Puerto Rico - Rio Piedras, San Juan PR, 00931-3332, USA;Department of Information and Decision Sciences, College of Business Administration, University of Texas at El Paso, 500 West University Avenue, El Paso, TX 79968, USA;Turner College of Business, Columbus State University, Columbus, GA 31907, USA
Venue:
Computers and Operations Research
Year:
2010

Citing 7
Cited 1

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

Computers and Operations Research
Adaptive temperature control for simulated annealing: a comparative study

Computers and Operations Research
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

Computers and Operations Research
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups

Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
A neural network to enhance local search in the permutation flowshop

Computers and Industrial Engineering
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

Computers and Operations Research
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Computers and Operations Research

Two-machine flowshop scheduling with flexible operations and controllable processing times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose a reformulation for the flowshop problem based on the concept of operation to workstation flexibility. While we assume a fixed sequence of operations in the reformulation, the ''location'' of each operation within the flow is not fixed. The proposed flowshop problem is important because the effective use of this flexibility can lead to significant changes in production performance. Solving the proposed problem involves two sub-problems: assignment of operations to workstations and sequencing of the jobs. We present a lower bound procedure and efficient solution approaches to solve each sub-problem. Furthermore, an improvement method based on neighborhood search and simulated annealing is implemented. A set of experiments is analyzed under different combinations of the proposed heuristics achieving high quality results. These experiments demonstrate that the heuristic factor is of significance for the problem.