Predictive Approach on Flexible Job Shop Scheduling Problem Considering Controllable Processing Times

Yulianty, Astri

doi:10.7763/ijimt.2013.v4.462

Cited by 5 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The objectives of the algorithm are to minimise makespan, maximum workload and total workload. Yulianty and Ma'ruf [173] proposed an algorithm for solving the FJSP considering controllable processing time and expected downtime by using a predictive approach.…”

Section: Single Solution-based Meta-heuristicsmentioning

confidence: 99%

Review on flexible job shop scheduling

Xie

Gao

Peng

et al. 2019

IET Collaborative Intelligent Manufacturing

142

View full text Add to dashboard Cite

Flexible job shop scheduling problem (FJSP) is an NP‐hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid to tackle this problem. In this study, the existing solution methods for the FJSP in recent literature are classified into exact algorithms, heuristics and meta‐heuristics, which are reviewed comprehensively. Moreover, the real‐world applications of the FJSP are also introduced. Finally, the development trends of the manufacturing industry are analysed, and the future research opportunities of the FJSP are summarised in detail.

show abstract

Section: Single Solution-based Meta-heuristicsmentioning

confidence: 99%

Review on flexible job shop scheduling

Xie

Gao

Peng

et al. 2019

IET Collaborative Intelligent Manufacturing

142

View full text Add to dashboard Cite

show abstract

“…Experiments show that applying game theory can find solution with better performance for both robustness and stability as compared to other rescheduling strategies. Yulianty and Ma'ruf () developed mathematical models for FJSSP with controllable processing time and expected downtime by using predictive approach with minimization of rescheduling cost and tardiness as the objective functions. The authors developed mathematical models to build an initial solution that determines job assignment and processing times of the jobs.…”

Section: Review Of Techniques Used For Fjsspmentioning

confidence: 99%

A research survey: review of flexible job shop scheduling techniques

Chaudhry

Khan

2015

Int Trans Operational Res

335

138

View full text Add to dashboard Cite

In the last 25 years, extensive research has been carried out addressing the flexible job shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to hybrid techniques have been used in this research. The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution. The paper comprises evaluation of publications and research methods used in various research papers. Finally, conclusions are drawn based on performed survey results.

show abstract

“…Mixed integer linear programming models for the FJSP have been proposed by Roshanaei et al [152], Demir and İşleyen [55], Yulianty and Ma'ruf [194], and Shen and Yao [163]. Although, due to the complexity of the problem, mainly metaheuristics have been investigated.…”

Section: Scheduling Problemmentioning

confidence: 99%