From Time Representation in Scheduling to the Solution of Strip Packing Problems

Computers and Chemical Engineering - United Kingdom
doi 10.1016/j.compchemeng.2012.05.002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Solution of FMS Scheduling Problems Using the Hybrid Dynamical Approach

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2002English

Fundamental Challenges in Packing Problems: From Spherical to Non-Spherical Particles

Soft Matter
ChemistryCondensed Matter Physics
2014English

Modified Strip Packing Heuristics for the Rectangular Variable-Sized Bin Packing Problem

ORiON
2010English

A Harmonic Algorithm for the 3D Strip Packing Problem

SIAM Journal on Computing
MathematicsComputer Science
2013English

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

The Densest Packing of Equal Circles Into a Parallel Strip

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1991English

Asymptotic Representation of a Solution to a Singular Perturbation Linear Time-Optimal Problem

Proceedings of the Steklov Institute of Mathematics
Mathematics
2013English

Computing Methods for the Approximate Solution of Time Dependent Problems

1994English

Smart-Grid Electricity Allocation via Strip Packing With Slicing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy