2018
DOI: 10.22219/jtiumm.vol19.no2.148-156
|View full text |Cite
|
Sign up to set email alerts
|

Pengembangan Algoritma Non Delay Pada Kasus Penjadwalan Non-Permutation Hybrid Flowshop Untuk Minimasi Mean Flowtime

Abstract: Production scheduling is one of the key success factors in the production process. Scheduling approach with Non-Permutation flow shop is a generalization of the traditional scheduling problems Permutation flow shop for the manufacturing industry to allow changing the job on different machines with the flexibility of combinations. This research tries to develop a heuristic approach that is non-delay algorithm by comparing Shortest Processing Time (SPT) and Largest Remaining Time (LRT) in the case of non-permuta… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…It is not practical in a real-world application where the number of jobs is significant. Hence, other approaches, such as heuristic [31] and metaheuristics [32], can be applied in a realworld application.…”
Section: Resultsmentioning
confidence: 99%
“…It is not practical in a real-world application where the number of jobs is significant. Hence, other approaches, such as heuristic [31] and metaheuristics [32], can be applied in a realworld application.…”
Section: Resultsmentioning
confidence: 99%