Single Machine Order Acceptance Scheduling with Periodic Energy Consumption Limits
Abstract
This work presents an Order Acceptance Scheduling (OAS) problem with the introduction of energy consumption limits at each period of the planning horizon. The objective is to maximize total profit of accepted orders while considering energy usage over time, in accordance with imposed deadlines. A time-indexed formulation is presented to tackle the investigated problem.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|---|
| licence |
