Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
European Journal of Operational ResearchPublished 1 January 1994
John L. Hunsucker, Jaymeen R. Shah
Citations77
SJR quartileQ1
SJR score2.24
SNIP2.62
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A dynamic simulation model of the constrained flow shop with multiple processors environment was developed in which the queuing priorities at each machine stage were established dynamically, and the results indicated that the shortest processing time first dispatching procedure (SPT) yielded superior performance for the makespan and mean flow time criteria.
Abstract
Scheduling in a flow shop with multiple processors (FSMP) involves the sequencing of n jobs in a flow shop, where two or more identical processors are allowable at a machine stage. The constrained flow shop with multiple processors problem (CFSMP) considered in this study is a special case of the FSMP problem, in which the total number of jobs that can concurrently exist in the system is bounded by a prespecified number. A simulation experiment was performed to investigate the performance of six priority rules in the CFSMP environment for three performance measures namely makespan, mean flow time, and maximum flow time. A dynamic simulation model of the constrained flow shop with multiple processors environment was developed in which the queuing priorities at each machine stage were established dynamically. The results of the simulation study indicated that the shortest processing time first dispatching procedure (SPT) yielded superior performance for the makespan and mean flow time criteria. However, for the maximum flow time criterion, clear superiority of a particular dispatching procedure was not established.
Keywords
Engineering
Journal of the American Statistical AssociationSimulation Modeling and Analysis.
8,874 Citations1983Mark J. Schervish, Averill M. Law +1 more
The text is designed for a one-term or two-quarter course in simulation offered in departments of industrial engineering, business, computer science and operations research.
TechnometricsApplied Regression Analysis and Other Multivariable Methods
8,351 Citations1989Esteban Walker, David G. Kleinbaum +2 more
Statistics for experimenters. An introduction to design, data analysis, and model building.
4,028 Citations1978George E. P. Box, William G. Hunter +1 more
Operational Research Quarterly (1970-1977)Introduction to Sequencing and Scheduling
2,619 Citations1977A. J. Clewett, Kenneth R. Baker
Mathematics of Operations ResearchThe Complexity of Flowshop and Jobshop Scheduling
2,601 Citations1976M. R. Garey, David Johnson +1 more
The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
Operations ResearchA Survey of Scheduling Rules
1,295 Citations1977S. S. Panwalkar, Wafik H. Iskander
This paper presents a summary of over 100 priority dispatching rules, a list of many references that analyze them, and a classification scheme.
TechnometricsFundamental Concepts in the Design of Experiments
1,268 Citations2000Eric R. Ziegel, Charles Roger Hicks +1 more
International Journal of Production ResearchA state-of-the-art survey of dispatching rules for manufacturing job shop operations
1,005 Citations1982John H. Blackstone, Don T. Phillips +1 more
Journal of the Operational Research SocietySequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
1,004 Citations1982Graham K. Rand, Simon French
Operations ResearchA Review of Production Scheduling
781 Citations1981Stephen C. Graves
The intent of this paper is to present a broad classification for various scheduling problems, to review important theoretical developments for these problem classes, and to contrast the currently available theory with the practice of production scheduling.
Journal of the Operational Research SocietyTwo-Stage, Hybrid Flowshop Scheduling Problem
551 Citations1988Jatinder N.D. Gupta
The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated and found to increase with the increase in the number of jobs.
Management ScienceAn Evaluation of Flow Shop Sequencing Heuristics
499 Citations1977David G. Dannenbring
Three previously unreported heuristics are included in the study, one of which turns out to be superior to the other ten heuristic tested and is presented in this paper.
European Journal of Operational ResearchSurvey of scheduling research involving due date determination decisions
494 Citations1989T.C.E. Cheng, Mahesh Gupta
A critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest is presented, observing that while the static single- machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods.
Management ScienceSome Tactical Problems in Digital Simulation
358 Citations1963R. W. Conway
This paper is concerned with the manner in which an investigation by simulated experimentation is conducted, after the model has been formulated and the computer program completed, and methods of improving the precision of results.
Introduction to SIMAN
295 Citations1988Deborah A. Davis, C. Dennis Pegden
The concepts and methods for simulating manufacturing systems using the SIMAN simulation language, which incorporates special purpose features greatly simplify and enhance the modeling of the material handling component of a manufacturing system, are discussed.
European Journal of Operational ResearchBranch and bound algorithm for the flow shop with multiple processors
256 Citations1991Shaukat A. Brah, John L. Hunsucker
IBM Journal of Research and DevelopmentScheduling algorithms for flexible flow lines
196 Citations1985Robert J. Wittrock
This paper discusses scheduling algorithms for a certain kind of manufacturing environment, called the “flexible flow line,” and new heuristic algorithms specially suited to solve these problems in the context of a flexible flow line.
Operations ResearchAn Adaptable Scheduling Algorithm for Flexible Flow Lines
191 Citations1988Robert J. Wittrock
An algorithm that schedules the loading of parts into a manufacturing line to minimize the makespan and secondarily to minimize queueing is presented.
International Journal of Production ResearchSchedules for a two-stage hybrid flowshop with parallel machines at the second stage
143 Citations1991Jatinder N.D. Gupta, Enar A. Tunç
NCSU Libraries Repository (North Carolina State University Libraries)Statistical Analysis of Simulation Output Data
127 Citations1980Averill M. Law
Management ScienceOn Approximate Queueing Models of Dynamic Job Shops
123 Citations1985John A. Buzacott, J. George Shanthikumar
European Journal of Operational ResearchGlobal lower bounds for flow shops with multiple processors
117 Citations1995Daryl Santos, John L. Hunsucker +1 more
Global lower bounds on FSMP makespan problems are presented to assess the quality of heuristic solutions when the optimal solution is unknown to address problems of moderate to large scale.
Management ScienceSimulation of a Simplified Job Shop
116 Citations1960Christopher Baker, B. P. Dzielinski
This is a report of the results of some digital computer simulation studies of a simplified model of a job shop production process that found the average manufacturing times and predictability of completion times were used as measures of effectiveness.
Operations ResearchFeature Article—Statistical Analysis of Simulation Output Data
94 Citations1983Averill M. Law
A state-of-the-art survey of statistical analyses for simulation output data of a single simulated system is presented and how developments in simulation languages, computer graphics, and computer execution speed may affect the future of output analyses is discussed.
Journal of Manufacturing SystemsHeuristic methods for flexible flow line scheduling
92 Citations1987Sandeep Kochhar, Robert Morris
Heuristic methods for scheduling a flexible flow line are presented and dispatching is found to be useful in setup-intensive lines, but one of the conclusions is that care must be taken, as plausibly helpful rules can lead to unexpected deterioration of performance.
International Journal of Production ResearchScheduling in a two-stage manufacturing process
70 Citations1984SEETUARMA L. NARASTMHAN, SHRTKANT S. PANWALKAR
An heuristic solution procedure known as the CMD rule is presented for this multi-product, multistage, continuous flow problem and is designed to minimize the sum of idle time of machines and in-process waiting at the second stage.
Operations ResearchInterstage Transportation Planning in the Deterministic Flow-Shop Environment
64 Citations1987Michael A. Langston
This paper devise and formally analyze effective transportation strategies for various situations in this flow-shop environment that are dependent on the amount of time needed for transportation relative to the amount required for task processing.
Production Planning & ControlModels and algorithms for a two-stage production process
54 Citations1990Hanif D. Sherali, Subhash C. Sarin +1 more
Decision SciencesA COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP
53 Citations1987Seetharama L. Narasimhan, Paul Mangiameli
This paper extends the rule presented by Narasimhan and Panwalker to include a general class of hybrid flow shops and demonstrates that the GCMD rule is better than the other rules in minimizing each of five chosen criteria.
OmegaPerformance of priority rules in a due date flow shop
49 Citations1992John L. Hunsucker, Jaymeen R. Shah
The study provides general guidelines for using a particular priority rule for the number of tardy jobs criterion depending upon the system parameters and finds that different priority rules yield good performances for different congestion levels in the system.
Naval Research Logistics QuarterlyStatistical analysis of the output data from terminating simulations
42 Citations1980Averill M. Law
This paper precisely defines the two types of simulations (terminating and steady-state) with regard to analysis of simulation output and discusses some common measures of performance for each type and discusses empirical results for fixed sample size, relative width, and absolute width procedures that can be used for constructing confidence intervals for Measures of performance in the terminating case.
Management SciencePriority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules
40 Citations1980Nabil R. Adam, Julius Surkis
Ease of implementation of the various procedures in a real world job shop environment is discussed, and a simple modification to remove the anomaly in ratio type dynamic priority rules is suggested.
Journal of Manufacturing SystemsSequencing in flexible manufacturing systems and other short queue-length systems
35 Citations1988Henry C. Co, T.J. Jaw +1 more
Scheduling model for computer systems with two classes of processors
28 Citations1972R. E. Buten, V. Y. Shen
Simulation results show the algorithms to be useful in scheduling less restricted job sets and an upper bound is seen to compare favorably with the upper bound intrinsic to the model.
Journal of Operations ManagementA simulation study of processing time dispatching rules
22 Citations1988Timothy D. Fry, Patrick R. Philipoom +1 more
The objective of the truncated SI rules was to improve upon the tardiness problem associated with the simple SI rule without worsening greatly the good performance of SI on job flowtimes.