Iterative job splitting algorithms for parallel machine scheduling with job splitting and setup resource constraints

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 61
  • Download : 0
This paper examines a parallel machine scheduling problem with job splitting and setup resource constraints for makespan minimization. Jobs can be split into multiple sections, and such sections can be processed simultaneously on different machines. It is necessary to change setups between the processes of different jobs on a machine, and the number of setups that can be performed simultaneously is restricted due to limited setup operators. To solve this problem, we propose a mathematical programming model and develop iterative job splitting algorithms that improve a feasible initial solution step by step, taking into account job splitting, setup times, and setup resources. We derive a worst-case performance ratio of the algorithms and evaluate the performance of the proposed heuristics on a large number of randomly generated instances. We finally provide a case study of piston manufacturing in Korea.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2021-03
Language
English
Article Type
Article
Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.72, no.4, pp.780 - 799

ISSN
0160-5682
DOI
10.1080/01605682.2019.1700191
URI
http://hdl.handle.net/10203/282502
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0