M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
In power generation and other production settings, technological constraints force restrictions on the number of time periods that a machine must stay up once activated, and stay down once deactivated. We characterize the polyhedral structure of a model representing these restrictions. We also describe a cutting-plane method for solving integer programs involving such min-up and min-down times for machines. Finally, we demonstrate how the polytope of our study generalizes the well-known cross polytope (i.e., generalized octahedron). © 2004 Elsevier B.V. All rights reserved.
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
Imran Nasim, Melanie Weber
SCML 2024
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998