Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 52
  • Download : 0
We address a uniform parallel machine scheduling problem with machine eligibility, job splitting, sequence-dependent setup times, and limited setup servers, which has been defined from a real applica-tion of piston manufacturing in Korea. The objective is to minimize the makespan. We first propose a mathematical programming model and derive four lower bounds. We then develop an efficient heuristic algorithm that assigns jobs to machines by considering processing times, setup times, and machine eligibility constraints, and then balances machine workloads by splitting jobs. We analyze a worst-case bound of the algorithm and perform extensive experiments with various scenarios. The gap from a lower bound is not significant for practical cases.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2021-02
Language
English
Article Type
Article
Citation

COMPUTERS & OPERATIONS RESEARCH, v.126

ISSN
0305-0548
DOI
10.1016/j.cor.2020.105115
URI
http://hdl.handle.net/10203/278672
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