Paper Info
Title
Bounds for parallel machine scheduling with predefined parts of jobs and setup time.
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.
Year
DOI
Venue
2018
10.1007/s10479-017-2615-z
Annals OR
Keywords
Field
DocType
Parallel machine scheduling, Worst-case bound, List schedules, LPT schedules, Heuristic algorithm
Machine scheduling,Job shop scheduling,Performance ratio,Heuristic (computer science),Computer science,Scheduling (computing),Internet of Things,Flow shop scheduling,Real-time computing,Schedule
Journal
Volume
Issue
ISSN
261
1-2
0254-5330
Citations 
PageRank 
References 
1
0.35
12
Authors
1
Name
Order
Citations
PageRank
Hyun-Jung Kim174.17