Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems

Authors:
S. Pugazhendhi;S. Thiagarajan;C. Rajendran;N. Anantharaman
Affiliations:
Department of Production Engineering, Annamalai University, Annamalai Nagar 608 002, India;Industrial Engineering and Management Division, Department of Humanities and Social Sciences, Indian Institute of Technology Madras, Chennai 600 036, India;Industrial Engineering and Management Division, Department of Humanities and Social Sciences, Indian Institute of Technology Madras, Chennai 600 036, India;Department of Production Engineering, Annamalai University, Annamalai Nagar 608 002, India
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 1
Cited 3

The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research

Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times

Computers and Operations Research
A note on two-stage hybrid flowshop scheduling with missing operations

Computers and Industrial Engineering
Scheduling flow lines with buffers by ant colony digraph

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A flowshop is a manufacturing environment with unidirectional flow of jobs through the various machines that are arranged in the order of job processing. A flowline-based manufacturing system (FBMS) is characterized by the flowline-based layout of machines with the machines arranged in the order of processing of jobs, but with the possibility of some or all jobs having missing operations on some machines. The significance of nonpermutation schedules (NPS) and their effect on improving the schedule performance measures, in the context of FBMS, is highlighted in this paper. A simple heuristic procedure to derive NPS from a given permutation schedule is proposed. Results of the extensive computational experimentation, with makespan as the primary criterion and total flowtime as the secondary criterion, are presented. The results show that the proposed heuristic procedure for generating non-permutation schedule set is effective and improves the schedule performance measures with minimal computational effort.