`Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
type: Item
instance of: scholarly article
title: `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
zbMATH Open document ID: 1198.90176
author: Moshe Dror
author: George Steiner
published in: Discrete Applied Mathematics
publication date: 2010-11-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 5810807
zbMATH Keywords: scheduling
zbMATH Keywords: posets
zbMATH Keywords: strong and weak precedence
MaRDI profile type: Publication
full work available at URL: j.dam.2010.06.015
OpenAlex ID: W2031053758
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Optimal scheduling for two-processor systems
cites work: Chains and trees: `Strong' -- `weak' order in job scheduling
cites work: Scheduling chains to minimize mean flow time
cites work: Tree precedence in scheduling: The strong-weak distinction
cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time
cites work: Optimal Sequencing of Two Equivalent Processors
cites work: `` Strong '' NP-Completeness Results
cites work: Scheduling Opposing Forests
cites work: Q3918137
cites work: Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
cites work: Single machine scheduling and due date assignment under series-parallel precedence constraints
cites work: Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
cites work: REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE
cites work: New results on the completion time variance minimization
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Q3929047
cites work: Q4055377
cites work: Q4918387
cites work: Sequencing with Series-Parallel Precedence Constraints
cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
cites work: On finding the jump number of a partial order by substitution decomposition
DOI: 10.1016/J.DAM.2010.06.015
description: scientific article; zbMATH DE number 5810807