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

Hyun-Jung Kim ()
Additional contact information
Hyun-Jung Kim: Sungkyunkwan University

Annals of Operations Research, 2018, vol. 261, issue 1, No 18, 412 pages

Abstract: Abstract 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.

Keywords: Parallel machine scheduling; Worst-case bound; List schedules; LPT schedules; Heuristic algorithm (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2615-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:261:y:2018:i:1:d:10.1007_s10479-017-2615-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2615-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().