2004
DOI: 10.1080/00207540310001649530
|View full text |Cite
|
Sign up to set email alerts
|

Solving the machine-loading problem in a flexible manufacturing system using a combinatorial auction-based approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(15 citation statements)
references
References 29 publications
0
15
0
Order By: Relevance
“…A genetic-algorithmbased-methodology is developed to solve the problem. Srinivas et al [21] addressed the FMS machine-loading problem where job selection and operation allocation on machines were to be performed such that there was a minimization of system unbalance and a maximization of throughput. The methodology of winner determination using the combinatorial auction process was employed to solve the FMS machine-loading problem.…”
Section: Heuristic-based Approachesmentioning
confidence: 99%
“…A genetic-algorithmbased-methodology is developed to solve the problem. Srinivas et al [21] addressed the FMS machine-loading problem where job selection and operation allocation on machines were to be performed such that there was a minimization of system unbalance and a maximization of throughput. The methodology of winner determination using the combinatorial auction process was employed to solve the FMS machine-loading problem.…”
Section: Heuristic-based Approachesmentioning
confidence: 99%
“…minimize the idle time of the machines, maximize the machine utilization) by defining jobs allocation of each part type to be produced to a given number of machines also satisfying technological constraints. Therefore, due to the different and simultaneous factors to be set, the problem of machine loading belongs to the NP-hard problems (Srinivas et al, 2004). …”
Section: Introductionmentioning
confidence: 99%
“…Heuristic approaches can deliver very fast solutions but tend to be myopic in nature [15]. Some dispatching rules such as the shortest processing time and earliest due date, are popular and provide good results [9,16]. However, these rules independently cannot consider real-time information and are unable to consider parallel and alternative process plans.…”
Section: Introductionmentioning
confidence: 99%