2015
DOI: 10.1007/978-3-662-47200-2_33
|View full text |Cite
|
Sign up to set email alerts
|

Minimizing Makespan Using Node Based Coincidence Algorithm in the Permutation Flowshop Scheduling Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 31 publications
0
1
0
Order By: Relevance
“…Another approach to optimize CM design is based on using appropriate scheduling techniques that aim to determine the actual assignment of products or jobs to available operations in order to complete manufacturing orders on time [8]. These techniques are mostly developed using the minimum makespan criterion for CM design optimization [9]. Moreover, makespan minimization positively influences work-in-process inventories [10,11].…”
Section: Introduction and Problem Descriptionmentioning
confidence: 99%
“…Another approach to optimize CM design is based on using appropriate scheduling techniques that aim to determine the actual assignment of products or jobs to available operations in order to complete manufacturing orders on time [8]. These techniques are mostly developed using the minimum makespan criterion for CM design optimization [9]. Moreover, makespan minimization positively influences work-in-process inventories [10,11].…”
Section: Introduction and Problem Descriptionmentioning
confidence: 99%