Flow Shop Scheduling Problem: a Computational Study (original) (raw)
A computational study has been developed to obtain optimal / near optimal solution for the flow shop scheduling problem with make-span minimization as the primary criterion and the minimization of either the mean completion time, total waiting time or total idle time as the secondary criterion. The objective is to determine a sequence of operations in which to process 'n' jobs on 'm' machines in same order (flow shop environment) where skipping is allowed. The Simulation approach for deterministic and stochastic flow shop scheduling has been developed. It reads and manipulates data for 500 jobs on 500 machines. Different factorial experiments present a comparative study on the performance of different dispatching rules, such as FCFS, SPT, LPT, SRPT and LRPT with respect to the objectives of minimizing makespan, mean flow time, waiting time of jobs, and idle time of machines. The proposed model is evaluated and found to be relatively more effective in finding optimal/ near optimal solutions in many cases. The influence of the problem size in computational time for this model is discussed and recommendations for further research are presented.
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
Scheduling heuristic for the n-jobm-machine flow shop
Omega, 1993
This paper addresses the problem of scheduling jobs in a flow shop manufacturing environment. A heuristic approach is developed for determining a priority sequence for the jobs with a view to minimizing total time to complete all the jobs. The approach is based on minimizing idle time on the last machine. The procedure is tested computationally and compared with the best known heuristic for flow shop sequencing. The proposed procedure demonstrates superior performance on larger problems, both in terms of quality of the solution and execution speed.
Advances in Mathematics: Scientific Journal
In the present paper a Flow shop scheduling model in two stage has been studied where the time taken by machines to setup is separately considered from the processing time. The probabilities with the processing times as well as with the setup times are also taken into account. The problem is structured specially for the cases when the minimum of expected processing times on second fictitious machine can never be less than to the maximum of expected processing times on first fictitious machine with the objective of minimizing the total of the waiting time for all the jobs. The two of the jobs has been grouped as a block. The significance of the objective has been made clear by computational experiments in comparison to the existing makespan approaches of Johnson and Palmer.
A heuristic approach to minimizing the waiting time of jobs in two-stage flow shop scheduling
Badania Operacyjne i Decyzje/Operations Research and Decisions, 2024
The paper presents the influence of the waiting time of jobs in a 2 machine k-job Flow Shop Scheduling (FSS) problem. The main intention of the study is to find a sequence of jobs that delivers the least sum of the time of waiting for jobs. A heuristic approach has been adopted to achieve the desired objective. The experiments are conducted for more than 2000 problems of various sizes for the problems with special structures and problems with random times of processing. The weighted mean absolute error (WMAE) for the average of the sum of the waiting times of jobs is computed for both kind of problems after comparing with the optimal solutions. WMAE has been obtained less than 0.0075 for problems with special structures and less than 0.087 for problems with random times of processing. The WMAE is also reducing significantly with the increase in job size. The results demonstrate that the presented step-by-step procedure of the heuristic delivers significantly close to optimal solutions.
Comparative study for Utilization of machines in the Flow-Shop Scheduling Problems
Scheduling is the procedure of generating the schedule which is a physical document and generally informs the happening of things and demonstrate a plan for the timing of certain activities. The flow shop problem is one of the most widely studied classical scheduling problems and reflects real operation of several industries. The aim of the present work is to evaluate the performance of four methods when it is used to solve flow shop scheduling problems with minimization makespan. The four heuristics methods are Johnson, Palmer, CDS and Gupta methods. In this work, an attempt has been made to solve the flow shop scheduling problem for comparative study for utilization of machines in the flow-shop scheduling problems among pervious methods. A simulation study has been made to evaluate the performance of the four method under consideration based on two performance measures makespan and utilization of machine , the results has been proved that the Palmer and CDS heuristic methods show the minimum value of average of makespan and average utilization of machine when it compared with other heuristic methods.
This paper is pertain to heuristic technique for n-jobs, 3-machines flowshop scheduling problem in which processing times and setup times are associated with their respective probabilities involving transportation time, break down interval and job block criteria is taken in to account. Further jobs are attached with weights to indicate their relative importance. The proposed method is very easy to understand and also provide an important tool for decision makers. A numerical illustration followed by a computer programme is also given to clarify the algorithm.
Heuristics for no-wait flow shop scheduling problem
International Journal of Industrial Engineering Computations, 2016
No-wait flow shop scheduling refers to continuous flow of jobs through different machines. The job once started should have the continuous processing through the machines without wait. This situation occurs when there is a lack of an intermediate storage between the processing of jobs on two consecutive machines. The problem of no-wait with the objective of minimizing makespan in flow shop scheduling is NP-hard; therefore the heuristic algorithms are the key to solve the problem with optimal solution or to approach nearer to optimal solution in simple manner. The paper describes two heuristics, one constructive and an improvement heuristic algorithm obtained by modifying the constructive one for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan. The efficiency of the proposed heuristic algorithms is tested on 120 Taillard's benchmark problems found in the literature against the NEH under no-wait and the MNEH heuristic for no-wait flow shop problem. The improvement heuristic outperforms all heuristics on the Taillard's instances by improving the results of NEH by 27.85%, MNEH by 22.56% and that of the proposed constructive heuristic algorithm by 24.68%. To explain the computational process of the proposed algorithm, numerical illustrations are also given in the paper. Statistical tests of significance are done in order to draw the conclusions.
FLOW SHOP SCHEDULING IN A MEDIUM SCALE INDUSTRY – A REVIEW FOR FUTURE ASPECT 1
In the field of scheduling, the flow shop problems have been thoroughly studied. In this paper we propose a concise overview of flow shop scheduling techniques evolved during the time period. We surveyed the exact and heuristics methods for solving various flow shop scheduling problems. As a result various optimization techniques, solution procedures are available to solve a variety of problems. We also present a brief glimpse of the evolution of flow shop scheduling problems and possible approaches for their solutions. This paper also concludes with some fruitful directions for the future research.
A heuristic algorithm for scheduling in a flow shop environment to minimize makespan
Scheduling 'n' jobs on 'm' machines in a flow shop is NP-hard problem and places itself at prominent place in the area of production scheduling. The essence of any scheduling algorithm is to minimize the makespan in a flowshop environment. In this paper an attempt has been made to develop a heuristic algorithm, based on the reduced weightage of machines at each stage to generate different combination of 'm-1' sequences. The proposed heuristic has been tested on several benchmark problems of Taillard (1993) [Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.]. The performance of the proposed heuristic is compared with three well-known heuristics, namely Palmer's heuristic, Campbell's CDS heuristic, and Dannenbring's rapid access heuristic. Results are evaluated with the best-known upper-bound solutions and found better than the above three.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.