An efficient heuristic approach to the scheduling of jobs in a flowshop

Rajendran, Chandrasekharan; Chaudhuri, Dipak

doi:10.1016/0377-2217(92)90361-c

Cited by 82 publications

(34 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The various heuristics for makespan criterion are proposed by Johnson [2], Palmer [3], Campbell [4], Gupta [5], Nawaz [6], Valdimir Modrak [7] and Mircea Ancau [8]. For a total flow time criterion, Rajendran and Chaudhuri [9], Liu and Reeves [10] and Deepak Laha and Chakraborty [11] proposed various heuristics. Rajendran and Chaudhuri [9] proposed constructive heuristics based on the machine idle times and the job waiting times.…”

Section: Literature Reviewmentioning

confidence: 99%

“…For a total flow time criterion, Rajendran and Chaudhuri [9], Liu and Reeves [10] and Deepak Laha and Chakraborty [11] proposed various heuristics. Rajendran and Chaudhuri [9] proposed constructive heuristics based on the machine idle times and the job waiting times. Liu and Reeves [10] developed composite heuristics by appending jobs one by one using index function.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling

Rathinam¹,

Govindan

Raghavan³

2015

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper Production scheduling plays a vital role in the planning and operation of a manufacturing system. Better scheduling system has a significant impact on cost reduction and minimum work-in-process inventory. This work considers the problem of scheduling n/m/F/ΣCi using Decision Tree (DT) algorithm. Since this problem is known to be strongly NP-hard, this work proposes heuristic based methodology to solve it. The advantages of DT's are that the dispatching rule is in the form of If-then else rules which are easily understandable by the shop floor people. The proposed approach is tested on benchmark problems available in the literature and compared. The proposed work is a complement to the traditional methods.Keywords: decision tree algorithm and heuristics; flow shop scheduling; total flow time Na pravilu zasnovan heuristički pristup smanjenju ukupnog protoka vremena kod programiranja radova u permutacijskoj protočnoj radionici Izvorni znanstveni članak Programiranje radova u proizvodnji je od bitne važnosti u planiranju i funkcioniranju proizvodnog sustava. Unaprijeđeni sustav programiranja značajno utječe na smanjenje troškova i minimalni broj radnih postupaka. U ovom se radu razmatra problem programiranja n/m/F/ΣCi primjenom Decision Tree (DT) algoritma. Budući da je ovaj problem poznat kao veoma NP-hard, u radu se za njegovo rješenje predlaže metodologija temeljena na heuristici. Prednosti DT-a su u tome što je pravilo otpreme u obliku If-then else pravila koja radnici u radionici lako razumiju. Predloženi je pristup testiran na repernim problemima dostupnim u literaturi i uspoređen. Predloženi rad je dodatak tradicionalnim metodama.Ključne riječi: decision tree algoritam i heuristika; programiranje radova u protočnoj radionici; ukupni protok vremena

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling

Rathinam¹,

Govindan

Raghavan³

2015

Teh. vjesn.

View full text Add to dashboard Cite

show abstract

“…The development of heuristics is found to be the main focus of scheduling research, as most of the scheduling problems are computationally difficult to solve. Some of the noteworthy heuristics for minimizing makespan have been proposed by Campbell et al [2], Nawaz et al [3], Widmer and Hertz [4], Taillard [5], Ogbu and Smith [6], Ishibuchi [7], and Ben Daya and AlFawzal [8]; whereas, the problem of scheduling to minimize total or mean flowtime has been researched extensively by Miyazaki et al [9], Rajendran and Chaudhuri [10], Rajendran [11] and Ho [7]. Rajendran [13] proposed the correct mathematical formulation of recursive equations in the context of flowline-based manufacturing systems.…”

Section: Introductionmentioning

confidence: 99%

Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective

Pugazhendhi

Thiagarajan

Rajendran

et al. 2004

Int J Adv Manuf Technol

View full text Add to dashboard Cite

The flowline-based manufacturing system (FBMS) is a manufacturing environment wherein machines are arranged in the order in which jobs undergo operations, and jobs have an identical and uni-directional flow pattern. However, some or all jobs may not require processing on some machines. Scheduling of jobs in such a FBMS is considered in this paper with the focus on the development of non-permutation schedules. The significance of non-permutation schedules in improving the schedule performance measures, in the context of FBMS's, is first brought out. A heuristic procedure to derive non-permutation schedules from a given permutation schedule is subsequently proposed. The minimization of total flowtime of jobs is considered as the objective in the first instance, followed by the consideration of the minimization of total weighted flowtime of jobs. An extensive computational experimentation has been performed to evaluate the effectiveness of the proposed heuristic in improving the performance measures. Further, the performance of the proposed heuristic in generating non-permutation schedules has been compared with that of the benchmark dispatching rules namely, the SPT and SWPT rules.

show abstract

“…For decades, heuristics have been developed for the problems considered. Heuristics presented by Gupta [8], Rajendran & Chaudhuri [12], Rajendran [16], Ho [9] and Wang et al [18] were efficient algorithms for these problems before NEH [11] seems to be the best heuristic for makespan minimization, while it is not the best for total/mean flowtime minimization [9,12,16]. NEH is based on job-insertion, in which an unscheduled job of the seed generated by some rule is respectively inserted into every possible slot of the current solution (a schedule/partial schedule) and the best generated one is selected as the new current solution.…”

Section: Introductionmentioning

confidence: 99%

Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization

Wang

Information Technology for Balanced Manufacturing Systems

View full text Add to dashboard Cite

show abstract

An efficient heuristic approach to the scheduling of jobs in a flowshop

Cited by 82 publications

References 16 publications

Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling

Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling

Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective

Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization

Contact Info

Product

Resources

About