Untitled

Hall, Nicholas G.; Sriskandarajah, Chelliah; Ganesharajah, Tharmarajah

doi:10.1023/a:1014903232563

Cited by 15 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computational complexity aspect of no-wait shop scheduling is discussed by Sriskandarajah and Ladet [13]. Along with the computational complexity, Goyal and Sriskandarajah [14] have also mentioned approximate algorithms for the problem. In past decades, most research focused on developing heuristics which are generally classified as constructive heuristics and metaheuristics.…”

Section: Fig 1 Classification Of Manufacturing Schedulingmentioning

confidence: 99%

Optimization Techniques for No-Wait Manufacturing Scheduling: A Review

Sapkal

Laha

Behera

2012

AMR

View full text Add to dashboard Cite

This paper deals with a general continuous or no-wait manufacturing scheduling problem. Due to its applications in advanced manufacturing systems, no-wait scheduling has gained much attention in both practical and academic fields. Due to its NP-hard nature, most of the contributions focus on development of approximation based optimization methods or heuristics for the problem. Several heuristic procedures have been developed to solve this problem. This paper presents a survey of various methodologies developed to solve no-wait flow shop scheduling problem with the objective of minimizing single performance measure

show abstract

Section: Fig 1 Classification Of Manufacturing Schedulingmentioning

confidence: 99%

Optimization Techniques for No-Wait Manufacturing Scheduling: A Review

Sapkal

Laha

Behera

2012

AMR

View full text Add to dashboard Cite

show abstract

Reentrant FMS scheduling in loop layout with consideration of multi loading-unloading stations and shortcuts

Rifai

Dawal

Zuhdi

et al. 2015

Int J Adv Manuf Technol

View full text Add to dashboard Cite

The scheduling problem in flexible manufacturing systems (FMS) environment with loop layout configuration has been shown to be a NP-hard problem. Moreover, the improvement and modification of the loop layout add to the difficulties in the production planning stage. The introduction of multi loading-unloading points and turntable shortcut resulted on more possible routes, thus increasing the complexity. This research addressed the reentrant FMS scheduling problem where jobs are allowed to reenter the system and revisit particular machines. The problem is to determine the optimal sequence of the jobs as well as the routing options. A modified genetic algorithm (GA) was proposed to generate the feasible solutions. The crowding distance-based substitution was incorporated to maintain the diversity of the population. A set of test was applied to compare the performance of the proposed approach with other methods. Further computational experiments were conducted to assess the significance of multi loading-unloading and shortcuts in reducing the makespan, mean flow time, and tardiness. The results highlighted that the proposed model was robust and effective in the scheduling problem for both small and large size problems.

show abstract