A heuristic algorithm for the flowshop scheduling problem

Gupta, Jatinder N. D.

doi:10.1051/ro/197610v200631

Cited by 9 publications

(5 citation statements)

References 18 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, Johnson and the CDS heuristic do not consider re-entrance, setup times and due dates. Branch and bound based approaches presented in [6], [7] find optimal schedules for the flowshop scheduling problem. Similarly mixed integer programs are used by [8], [9] to solve different variants of flowshop scheduling problem to optimality but are not suitable for online scheduling.…”

Section: Resultsmentioning

confidence: 99%

A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer

Waqas¹,

Geilen²,

Kandelaars³

et al. 2015

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2015

View full text Add to dashboard Cite

Abstract-A Large Scale Printer (LSP) is a CyberPhysical System (CPS) printing thousands of sheets per day with high quality. The print requests arrive at run-time requiring online scheduling. We capture the LSP scheduling problem as online scheduling of reentrant flowshops with sequence dependent setup times and relative due dates with makespan minimization as the scheduling criterion. Exhaustive approaches like Mixed Integer Programming can be used, but they are compute intensive and not suited for online use. We present a novel heuristic for scheduling of LSPs that on average requires 0.3 seconds per sheet to find schedules for industrial test cases. We compare the schedules to lower bounds, to schedules generated by the current scheduler and schedules generated by a modified version of the classical NEH (MNEH) heuristic [1], [2]. On average, the proposed heuristic generates schedules that are 40% shorter than the current scheduler, have an average difference of 25% compared to the estimated lower bounds and generates schedules with less than 67% of the makespan of schedules generated by the MNEH heuristic.

show abstract

Section: Resultsmentioning

confidence: 99%

A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer

Waqas¹,

Geilen²,

Kandelaars³

et al. 2015

Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE), 2015

View full text Add to dashboard Cite

show abstract

“…Also, King and Spachis [18] evaluated the performance of some earlier heuristic in literature. An improved functional heuristic was developed by Gupta [12,13]. The algorithm based on the priority to be given to jobs with large total processing time was proposed by Nawaz et al [20] (also known as NEH).…”

Section: Literature Reviewmentioning

confidence: 99%

A Heuristic for Permutation Flowshop Scheduling to Minimize Makespan

Gupta¹,

Nailwal

Sharma

2014

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

As the problem related to minimizing makespan as objective is NP-hard for more than two machines in flowshop scheduling, therefore need for heuristics have been felt to yield optimal or near optimal solutions in polynomial time. In the present paper, we propose an alternative heuristic algorithm which is compared with the benchmark Palmer's, CDS and NEH algorithm for the processing of n-jobs through m-machines. The proposed heuristic gives solution for solving n-job and m-machine flowshop scheduling problem with minimizing makespan as criteria. Comparisons have been made for tested instances.

show abstract

“…The combinatorial approach started by Dudek and Teuton (1964) was corrected and improved by Smith and Dudek (1967), McMahon (1969), Gupta (1971), and Szwarc (1971Szwarc ( , 1973. The branch and bound solution approaches were also developed during this time by Lomnicki (1965), Brown and Lomnicki (1966), McMahon and Burton (1967), Gupta (1969bGupta ( , 1970, and others. These branch and bound approaches differ in terms of the lower bounds used and the branching strategies.…”

Section: Five Decades Of Flowshop Scheduling Researchmentioning

confidence: 99%