Parallel dedicated machines scheduling with chain precedence constraints
type: Item
instance of: scholarly article
title: Parallel dedicated machines scheduling with chain precedence constraints
zbMATH Open document ID: 1253.90107
author: Alessandro Agnetis
author: Hans Kellerer
author: Gaia Nicosia
author: Andrea Pacifici
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6119447
zbMATH Keywords: scheduling
zbMATH Keywords: parallel dedicated machines
zbMATH Keywords: precedence constraints
zbMATH Keywords: two-job job shop
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.03.040
OpenAlex ID: W2016002075
cites work: Scheduling three chains on two parallel machines
cites work: A job-shop problem with one additional resource type
cites work: Minimum cost multi-product flow lines
cites work: A Non-Numerical Approach to Production Scheduling Problems
cites work: Review of properties of different precedence graphs for scheduling problems
cites work: An efficient algorithm for the job-shop problem with two jobs
cites work: Complexity of shop-scheduling problems with fixed number of jobs: a survey
cites work: A decomposition theorem for partially ordered sets
cites work: Q4198056
cites work: Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
cites work: A Geometric Model and a Graphical Algorithm for a Sequencing Problem
cites work: Q3598877
cites work: Heuristics for unrelated machine scheduling with precedence constraints
cites work: Scheduling parallel dedicated machines under a single non-shared resource
cites work: Scheduling problems for parallel dedicated machines under multiple resource constraints.
cites work: Scheduling on unrelated machines under tree-like precedence constraints
cites work: The complexity of shop-scheduling problems with two or three jobs
cites work: NP-hardness of shop-scheduling problems with three jobs
cites work: Solution of the Akers-Friedman Scheduling Problem
DOI: 10.1016/J.EJOR.2012.03.040
Recommended article: Parallel machine scheduling with precedence constraints and setup times
Recommended article: On a parallel machine scheduling problem with precedence constraints
Recommended article: Scheduling preemptive jobs with precedence constraints on parallel machines
Recommended article: Scheduling problems for parallel dedicated machines under multiple resource constraints.
Recommended article: Single machine parallel batch scheduling subject to precedence constraints
Recommended article: Precedence constrained parallel-machine scheduling of position-dependent jobs
Recommended article: Scheduling of uniform parallel machines with s-precedence constraints
Recommended article: Parallel machine scheduling with preference of machines
Recommended article: Parallel machine scheduling with job assignment restrictions
description: scientific article; zbMATH DE number 6119447