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

DOI10.1016/j.cor.2007.10.025zbMath1163.90006OpenAlexW2016664928MaRDI QIDQ955602

Ik-Sun Lee, Eun-Seok Kim, Chang Sup Sung

Publication date: 20 November 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.025

zbMATH Keywords

heuristicprecedence constraintsparallel machine schedulingtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Scheduling of uniform parallel machines with s-precedence constraints ⋮ Machine scheduling with soft precedence constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling chains to minimize mean flow time
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Integer programming and combinatorial optimization. 5th international IPCO conference, Vancouver, Canada, June 3--5, 1996. Proceedings
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
• A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Task scheduling with precedence constraints to minimize the total completion time
• Optimal Linear Ordering
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties

This page was built for publication: Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints