Exact and approximate methods for parallel multiple-area spatial scheduling with release times

DOI10.1007/s00291-012-0301-8zbMath1282.90068DBLPjournals/ors/GarciaR13OpenAlexW1976417135WikidataQ58839255 ScholiaQ58839255MaRDI QIDQ2393121

Ghaith Rabadi, Christopher Garcia

Publication date: 7 August 2013

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-012-0301-8

zbMATH Keywords

integer programmingheuristicrelease timesspatial scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem

Cites Work

• Time-constrained project scheduling with adjacent resources
• On the complexity of adjacent resource scheduling
• Three-dimensional bin packing problem with variable bin height
• An analytical model for the container loading problem
• Packing small boxes into a big box.
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Adjacent-Resource Scheduling
• Orthogonal Packings in Two Dimensions
• Scheduling

This page was built for publication: Exact and approximate methods for parallel multiple-area spatial scheduling with release times