Job-shop cell-scheduling problem with inter-cell moves and automated guided vehicles

Zeng, Chengkuan; Tang, Jiafu; Yan, Chongjun

doi:10.1007/s10845-014-0875-x

Cited by 33 publications

(14 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zeng et al. () studied the problem of parts scheduling in job shop cells by minimizing the makespan and proposed a mathematical model for these test problems. They used a neighborhood based on the disjunctive graph model to guarantee the efficiency of the proposed algorithm.…”

Section: Introductionmentioning

confidence: 99%

A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method

Deliktaş

Torkul

Üstün

2017

Int Trans Operational Res

View full text Add to dashboard Cite

In this paper, we propose novel mathematical models involving both single‐ and biobjective functions that deal with a flexible job shop scheduling problem in cellular manufacturing environment by taking into consideration exceptional parts, intercellular moves, intercellular transportation times, sequence‐dependent family setup times, and recirculation. The problem has been known as NP‐hard. The proposed models have been tested and solved using Lingo 11.0 with minimization of makespan for the problems involving about 4 cells, 4 part families, 15 parts, and 12 machines. The most suitable model among the proposed single‐objective models is determined using the test results. Then, another objective function as total tardiness is added to this model. The obtained biobjective model is solved using the scalarization methods, the weighted sum method, ɛ‐constraint method, and conic scalarization method (CSM), in order to convert the mathematical model's objectives into a single‐objective function. By utilizing these scalarization methods, the Pareto effective solutions are generated for a specific test problem. The advantages of the CSM are demonstrated by considering the Pareto effective solutions.

show abstract

Section: Introductionmentioning

confidence: 99%

A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method

Deliktaş

Torkul

Üstün

2017

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…However, the different scheduling rules produce different performances or complexity of a system (Chuen and Robert 1993 ; Grabot and Geneste 1994 ; Holthaus and Rajendran 1997 ; Amirghasemi and Zamani 2014 ; Nurre and Sharkey 2014 ; Xu et al 2015 ; Zeng et al 2015 ). The comparative analysis of scheduling rules in some specific industrial environments can be found in Rajendran and Holthaus ( 1999 ), Kizil et al ( 2006 ), Chiang and Fu ( 2007 ), Akturk ( 2011 ), and Li et al ( 2015 ).…”

Section: Influence Of the Scheduling Rules On Line- Seru mentioning

confidence: 99%

Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization

Wang

Tang

et al. 2016

SpringerPlus

Self Cite

View full text Add to dashboard Cite

Productivity can be greatly improved by converting the traditional assembly line to a seru system, especially in the business environment with short product life cycles, uncertain product types and fluctuating production volumes. Line-seru conversion includes two decision processes, i.e., seru formation and seru load. For simplicity, however, previous studies focus on the seru formation with a given scheduling rule in seru load. We select ten scheduling rules usually used in seru load to investigate the influence of different scheduling rules on the performance of line-seru conversion. Moreover, we clarify the complexities of line-seru conversion for ten different scheduling rules from the theoretical perspective. In addition, multi-objective decisions are often used in line-seru conversion. To obtain Pareto-optimal solutions of multi-objective line-seru conversion, we develop two improved exact algorithms based on reducing time complexity and space complexity respectively. Compared with the enumeration based on non-dominated sorting to solve multi-objective problem, the two improved exact algorithms saves computation time greatly. Several numerical simulation experiments are performed to show the performance improvement brought by the two proposed exact algorithms.

show abstract

“…Cell scheduling can be divided into cell internal scheduling and scheduling between multiple cells [3], the problem of internal scheduling has been studied by quite a few scholars. Mak et al [4] studied the dynamic scheduling problem of parts in Virtual Manufacturing Cell under multi -period of determining demand.…”

Section: Introductionmentioning

confidence: 99%

Inter Cell Scheduling Based on Queuing Networks

Lv¹,

Zhang²,

Han³

2017

Proceedings of the 3rd Annual International Conference on Management, Economics and Social Development (ICMESD 17)

View full text Add to dashboard Cite

Abstract. In virtual cellular manufacturing, the processing lines are more complex, products are multi-varieties and small quantities, jobs spend 90% of the time waiting for the machine to be processed is common. In order to reduce the waiting time, this paper study the inter cell scheduling based on queuing network. The virtual cellular manufacturing system is seen as a queuing network, and the input parameters of each node within the network are calculated by the external arrival rate. Under the strategy of batch service. Scheduling target is minimize the total processing time, maximize the minimum of equipment load. Batch service queuing network model is established. The model is solved by the immune optimization algorithm, which achieves the shortest processing time, and avoids the parts waiting. Finally, taking the actual production process of ship enterprises as an example, it is proved that the batch service queuing network method is feasible and efficient.

show abstract

Job-shop cell-scheduling problem with inter-cell moves and automated guided vehicles

Cited by 33 publications

References 36 publications

A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method

A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method

Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization

Inter Cell Scheduling Based on Queuing Networks

Contact Info

Product

Resources

About