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

DOI10.1007/978-3-319-18899-7_12zbMath1390.90327OpenAlexW2265244819MaRDI QIDQ4634982

Sudharshana Srinivasan, Jill Hardin Wilson, J. Paul Brooks

Publication date: 13 April 2018

Published in: Optimized Packings with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18899-7_12

zbMATH Keywords

approximation algorithmsinteger programsoptimal packingsspatial scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (1)

Optimal crashing of an activity network with disruptions

Cites Work

• Unnamed Item
• On the complexity of adjacent resource scheduling
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Batch scheduling with deadlines on parallel machines
• Developing scheduling systems for Daewoo shipbuilding: DAS project
• Two-dimensional packing problems: a survey
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times
• The two-dimensional bin packing problem with variable bin sizes and costs
• The Design of Approximation Algorithms
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

This page was built for publication: Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem