Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

Authors:
Eun-Seok Kim;Chang-Sup Sung;Ik-Sun Lee
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Guseong-dong, Yuseong-gu, Daejeon 305-701, Republic of Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Guseong-dong, Yuseong-gu, Daejeon 305-701, Republic of Korea;School of Business, Dong-A University, Saha-gu, Pusan 604-714, Republic of Korea
Venue:
Computers and Operations Research
Year:
2009

Citing 9
Cited 2

Principles of artificial intelligence

Principles of artificial intelligence
Scheduling chain-structured tasks to minimize makespan and mean flow time

Information and Computation
Scheduling chains to minimize mean flow time

Information Processing Letters
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Generating Experimental Data for Computational Testing with Machine Scheduling Applications

Operations Research
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

SIAM Journal on Computing

A GRASP approach to transporter scheduling and routing at a shipyard

Computers and Industrial Engineering
Scheduling of uniform parallel machines with s-precedence constraints

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relations are processed on multiple identical parallel machines. The objective is to minimize the total completion time. The s-precedence relation between two jobs i and j represents the situation where job j is constrained from processing until job i starts processing, which is different from the standard definition of a precedence relation where j cannot start until i completes. The s-precedence relation has wide applicability in the real world such as first-come-first-served processing systems. The problem is shown to be intractable, for which a heuristic procedure is derived. Numerical experiments are conducted to show that the derived heuristic provides effective solutions.