An exact algorithm for an identical parallel additive machine scheduling problem with multiple processing alternatives

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 48
  • Download : 0
This paper develops an exact algorithm for the identical parallel additive machine scheduling problem by considering multiple processing alternatives to minimise the makespan. This research is motivated from an idea of elevating flexibility of a manufacturing system by using additive machines, such as 3D printers. It becomes possible to produce a job in a different form; a job can be printed in a complete form or in separate parts. This problem is defined as a bi-level optimisation model in which its upper level problem is to determine a proper processing alternative for each product, and its lower level problem is to assign the parts that should be produced to the additive machines. An exact algorithm, which consists of the linear programming relaxation of a one-dimensional cutting stock problem, a branch-and-price algorithm, and a rescheduling algorithm, is proposed to find an optimal solution of the problem. The experimental results show that the computational time of the algorithm outperforms a commercial solver (CPLEX). By examining how the parts are comprised when the processing alternatives are optimally selected, some useful insights are derived for designing processing alternatives of products.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2022-07
Language
English
Article Type
Article
Citation

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.60, no.13, pp.4070 - 4089

ISSN
0020-7543
DOI
10.1080/00207543.2021.2007426
URI
http://hdl.handle.net/10203/297433
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0