A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 46
  • Download : 0
We examine a parallel machine scheduling problem with a job splitting property, sequence-dependent setup times, and limited setup operators, for minimizing makespan. Jobs are split into arbitrary (job) sections that can be processed on different machines simultaneously. When a job starts to be processed on a machine, a setup that requires an operator is performed, and the setup time is sequence-dependent. The number of setup operators is limited, and hence not all of the machines can be set up at the same time. For this problem, we propose a mathematical programming model and analyze a lower bound. We then develop a simple but efficient heuristic algorithm so that it can be used in practice, and analytically derive a worst-case bound of the algorithm. We finally evaluate the performance of the proposed algorithm numerically with various scenarios.
Publisher
SPRINGER
Issue Date
2021-12
Language
English
Article Type
Article
Citation

FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, v.33, no.4, pp.992 - 1026

ISSN
1936-6582
DOI
10.1007/s10696-020-09400-9
URI
http://hdl.handle.net/10203/288910
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
117560.pdf(2.48 MB)Download

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0