Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Authors:
Alex J. Ruiz-Torres;Grisselle Centeno
Affiliations:
Department of Information and Decision Sciences, University of Texas at El Paso, El Paso, TX 79968, USA;Department of Industrial Engineering, University of South Florida, Tampa, FL 33660, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 12
Cited 0

Scheduling parallel manufacturing cells with resource flexibility

Management Science
Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment

Computers and Operations Research
Heuristics for hybrid flow shops with controllable processing times and assignable due dates

Computers and Operations Research
Single machine scheduling with a variable common due date and resource-dependent processing times

Computers and Operations Research
Using the FDH formulation of DEA to evaluate a multi-criteria problem in parallel machine scheduling

Computers and Industrial Engineering
Comparison of heuristics for flowtime minimisation in permutation flowshops

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

Computers and Operations Research
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups

Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

Computers and Operations Research
A neural network to enhance local search in the permutation flowshop

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a permutation flowshop problem with secondary resources with the objective of minimizing the number of tardy jobs. The number of secondary resources assigned to the machines (workcenters), as well as the allocation of resources among the various machines, will play a significant role in the time required to process each job by its specified due date. This problem finds application in a large number of environments including manufacturing, maintenance, warehousing operations, as well as in healthcare. The research presents a lower bound for the permutation flowshop problem and evaluates its performance against the optimal solution for small, medium, and large instances. Several heuristics, including neighborhood search and simulated annealing, are presented to generate the secondary resource assignment and the allocation of jobs to the schedule. The computational complexity of the lower bound and computational examples for the heuristics are discussed.