Scheduling under the network of temporo-spatial proximity relationships
From MaRDI portal
Publication:1652320
DOI10.1016/j.cor.2017.03.011zbMath1391.90281OpenAlexW2598294848MaRDI QIDQ1652320
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.03.011
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- New perspectives in VLSI design automation: deterministic packing by sequence pair
- Strip packing with precedence constraints and strip packing with release times
- On the complexity of adjacent resource scheduling
- Hybrid metaheuristics. An emerging approach to optimization.
- Local search algorithms for the rectangle packing problem with general spatial costs
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Two-dimensional packing problems: a survey
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Computing and Combinatorics
- Optimal Rectangle Packing: An Absolute Placement Approach
- Approximation Algorithms for Scheduling Parallel Jobs
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
This page was built for publication: Scheduling under the network of temporo-spatial proximity relationships
