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

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

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2018-02, Vol.261 (1-2), p.401-412
Main Author: Kim, Hyun-Jung
Format: Article
Language:English
Subjects:
Algorithms
Business and Management
Combinatorics
Heuristic methods
Industrial equipment
Job shops
Management science
Operations research
Operations Research/Decision Theory
Parallel processing
Printers
Production scheduling
Schedules
Scheduling
Scheduling (Management)
Setup times
Short Note
Theory of Computation
Three dimensional printing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-017-2615-z