Batching-based approaches for optimized packing of jobs in the spatial scheduling problem

DOI10.1007/978-3-319-18899-7_12zbMATH Open1390.90327OpenAlexW2265244819MaRDI QIDQ4634982FDOQ4634982

Authors: 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

Recommendations

• Exact and approximate methods for parallel multiple-area spatial scheduling with release times
• Spatial scheduling and workforce assignment problem in block assembly shop of shipbuilding
• Spatial scheduling optimization algorithm for block assembly in shipbuilding
• A branch and bound algorithm for project scheduling problem with spatial resource constraints
• Batch scheduling in process industries: An application of resource-constrained project scheduling

zbMATH Keywords

approximation algorithmsoptimal packingsinteger programsspatial scheduling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Spatial scheduling and workforce assignment problem in block assembly shop of shipbuilding
• Optimal crashing of an activity network with disruptions

This page was built for publication: Batching-based approaches for optimized packing of jobs in the spatial scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634982)