Loading and scheduling for flexible manufacturing systems with controllable processing times

Citations

WEB OF SCIENCE

13
Citations

SCOPUS

16

초록

This study addresses the problem of determining the allocation of operations and their tools to machines, the operation processing times and the allocation/sequence of the parts to be processed on each machine for flexible manufacturing systems with controllable processing times. Tool lives, tool copies and tool sharing are also considered. An integer programming model is developed for the objective of minimizing the sum of operation processing and tardiness costs. Then, iterative algorithms are proposed that solve the two subproblems iteratively, where the loading subproblem is solved by a modified bin packing algorithm under initial processing times and the resulting scheduling subproblem is solved by a priority scheduling method while modifying the loading plans and operation processing times iteratively. Computational experiments were carried out, and the results are reported.

키워드

Flexible manufacturing systems; controllable processing times; loading and scheduling; iterative algorithms; JOB-SHOP; PROGRAMMING-MODEL; MACHINE; ALGORITHMS
제목
Loading and scheduling for flexible manufacturing systems with controllable processing times
저자
Zhou, Yi-Dong; Shin, Jeong-Hoon; Lee, Dong-Ho
DOI
10.1080/0305215X.2018.1469134
발행일
2019-03
유형
Article
저널명
Engineering Optimization
권
51
호
3
페이지
412 ~ 426