Parallel dedicated machines scheduling with chain precedence constraints
From MaRDI portal
Publication:1926857
DOI10.1016/j.ejor.2012.03.040zbMath1253.90107OpenAlexW2016002075MaRDI QIDQ1926857
Alessandro Agnetis, Hans Kellerer, Andrea Pacifici, Gaia Nicosia
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.03.040
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Handling precedence constraints in scheduling problems by the sequence pair representation, Solving multi-objective parallel machine scheduling problem by a modified NSGA-II, Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut
Cites Work
- Unnamed Item
- Unnamed Item
- A job-shop problem with one additional resource type
- Scheduling three chains on two parallel machines
- An efficient algorithm for the job-shop problem with two jobs
- The complexity of shop-scheduling problems with two or three jobs
- Heuristics for unrelated machine scheduling with precedence constraints
- Scheduling problems for parallel dedicated machines under multiple resource constraints.
- Review of properties of different precedence graphs for scheduling problems
- Scheduling parallel dedicated machines under a single non-shared resource
- NP-hardness of shop-scheduling problems with three jobs
- Scheduling on unrelated machines under tree-like precedence constraints
- Complexity of shop-scheduling problems with fixed number of jobs: a survey
- Minimum cost multi-product flow lines
- A decomposition theorem for partially ordered sets
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Solution of the Akers-Friedman Scheduling Problem
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
- A Non-Numerical Approach to Production Scheduling Problems
