Bounds for parallel machine scheduling with predefined parts of jobs and setup time

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 151
  • Download : 0
We examine a parallel machine scheduling problem with setup time in order to minimize the makespan. Each job consists of predefined parts, and the parts of a job can be processed concurrently in different machines. We first provide worst-case bounds of the Longest Processing Time and list schedules for special cases. We also develop a heuristic algorithm for scheduling parts of jobs with family setup time and propose its worst-case performance ratio. The application is the IoT-based smart factory with 3D printers as processing machines.
Publisher
SPRINGER
Issue Date
2018-02
Language
English
Article Type
Article
Citation

ANNALS OF OPERATIONS RESEARCH, v.261, no.1-2, pp.401 - 412

ISSN
0254-5330
DOI
10.1007/s10479-017-2615-z
URI
http://hdl.handle.net/10203/266079
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 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0