Coordination mechanism in real-time scheduling of Virtual Cellular Manufacturing Systems

Liang, Feng; Fung, Richard Y. K.

doi:10.1177/0954405414555559

Cited by 11 publications

(9 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A single-agent perspective and centralized perspective are both considered to achieve partial and global objectives. Liang and Fung 23 proposed explicit and implicit coordination mechanisms based on multi-agent technology to solve the real-time scheduling of virtual cellular manufacturing systems. They designed the point-to-point and subscribe/publish communication mode to realize real-time scheduling.…”

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Wen

2018

Advances in Mechanical Engineering

View full text Add to dashboard Cite

We study an agent-based scheduling problem of two identical parallel machines:. The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed to achieve the optimum from the two task agents, agent A and agent B. The objective is divided into two classes. The objectives of agent A and agent B are to minimize the total tardiness time and minimize the makespan, respectively. In this article, we research two identical parallel machines in which one job category can be processed by one machine agent only or two machine agents and propose a new multi-agent model for two identical parallel machines, divided into two subsystems. For subsystem 1, the shortest processing time order is used to solve job priorities. A single distribution strategy is proposed to assign jobs to machine agents and is applied to the dynamic scheduling environment. For subsystem 2, a centralized distribution strategy is applied to the static scheduling environment. The proposed model performs more efficiently and is better able to handle complex and dynamic scheduling environments.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Wen

2018

Advances in Mechanical Engineering

View full text Add to dashboard Cite

show abstract

“…Constraint (9) states the lower limit for the number of workers that should be assigned to a cell. Constraint (10) assures that a part can only be assigned to a cell if already a machine with the required capability (in terms of RE) to process the part is assigned to the same cell. Similarly, constraint (11) states that a part can only be assigned to a cell if already a worker with the required capability (in terms of RE) to process the part is assigned to the same cell.…”

Section: Lommentioning

confidence: 99%

“…Hence, it is possible to consider overlapping capabilities of machines and workers while forming manufacturing cells via REs. 2 RE-based approach was also adopted by Liang and Fung 10 to present a coordination mechanism in virtual cellular manufacturing systems (VCMSs) using multi-agent technology and the pheromone concept of ant colony optimization algorithm.…”

Section: Introductionmentioning

confidence: 99%

Manufacturing cell formation with flexible processing capabilities and worker assignment: Comparison of constraint programming and integer programming approaches

Baykasoğlu

Topaloğlu

Şenyüzlüler

2017

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

Cell formation deals with grouping of machines and parts in manufacturing systems according to their compatibility. Manufacturing processes are surrounded with an abundance of complex constraints which should be considered carefully and represented clearly for obtaining high efficiency and productivity. Constraint programming is a new approach to combinatorial optimization and provides a rich language to represent complex constraints easily. However, the cell formation problems are well suited to be solved by constraint programming approach since the problem has many constraints such as part-machine requirements, availabilities in the system in terms of capacity, machine and worker abilities. In this study, the cell formation problem is modeled using machine, part processing and worker flexibilities via resource element–based representation. Resource elements define the processing requirements of parts and processing capabilities of machines and workers, which are resource-independent capability units. A total of 12 case problems are generated, and different search phases of constraint programming are defined for the solution procedure. The cell formation problem is modeled in both constraint programming and integer programming, and a comparative analysis of constraint programming and integer programming model solutions is done. The results indicate that both the models are effective and efficient in the solution of the cell formation problem.

show abstract

“…Aggregating other production aspects like layout problem considerations and scheduling into the proposed model. 79,80…”

Section: Conclusion and Further Researchmentioning

confidence: 99%

Integrating multi-dynamic virtual cellular manufacturing systems into multi-market allocation and production planning

Aalaei

Kayvanfar

Davoudpour

2017

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

This article presents a two-stage approach to solve a multi-dynamic virtual cellular manufacturing system in multi-market allocation and production planning. The first stage identifies the plant locations and grouping parts–machines–workers’ assignment to virtual cells, while the second stage determines the production volume for each plant, the allocated amounts to each market and the operations’ allocation to the virtual cells. The goal of the proposed mathematical model is to minimize total expected cost consisting of holding, outsourcing, inter-cell material handling, external transportation, fixed cost for producing each part in each plant as well as machine and labour salaries. It is assumed that the parts’ processing times on each machine with workers as well as the products’ demands are stochastic and described by discrete scenario enrichment using the sample average approximation and Latin hypercube sampling techniques. To solve such a stochastic model, an efficient method based on the genetic algorithm is then utilized. Also, Taguchi method is employed so as to evaluate the effects of different operators and parameters on the performance of genetic algorithm. Finally, computational experiments on randomly generated test problems are presented to demonstrate the performance and power of developed model in handling uncertainty.

show abstract

Coordination mechanism in real-time scheduling of Virtual Cellular Manufacturing Systems

Cited by 11 publications

References 32 publications

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan

Manufacturing cell formation with flexible processing capabilities and worker assignment: Comparison of constraint programming and integer programming approaches

Integrating multi-dynamic virtual cellular manufacturing systems into multi-market allocation and production planning

Contact Info

Product

Resources

About