ppt课件-finite capacity scheduling- m i t c s a i l（有限容量调度- m我t c s l）.pptVIP

Finite Capacity Scheduling 6.834J, 16.412J Overview of Presentation What is Finite Capacity Scheduling? Types of Scheduling Problems Background and History of Work Representation of Schedules Representation of Scheduling Problems Solution Algorithms Summary What is Finite Capacity Scheduling? Informal and Partial Definitions Determining the best sequence of tasks on a resource Optimal assignment of limited resources to tasks to fulfill a set of orders Elimination of factory bottlenecks Formal Definition The allocation of resources over time to perform a set of tasks such that task precedence constraints and resource capacity constraints are not violated, and overall deadline goals are met to the best extent possible Example Schedule Gantt chart Types of Scheduling Problems Energy Job Shop Batch Process Discrete Manufacturing Servicing of Complex Equipment Scheduling of a Unique Resource Military Logistics Energy Scheduling Electrical utility generator scheduling to meet anticipated demand Ex. – Utility with 3 Generators Energy Scheduling (cont.) Demand Profile Energy Scheduling (cont.) Best Schedule: Let if generator i is on during time j, 0 otherwise be the energy generated by generator i during time j Cost can then be expressed as From the previous schedule, non-zero values of B and E are: So cost = 70 + 88 + 60 + 24 = 242 Constraints for this problem can be expressed as Where is demand at time j, and is the capacity of generator i. Note how this forces Eij to be 0 if Bij is. This, combined with the constraint that the B variables must be binary, and the previously defined cost function, yields an optimization problem with discrete and continuous constraints. Such problems are often solved by Mixed Integer Linear Programming algorithms (more on this later). Variations on Problem Suppose utility has 100 kwh energy storage device (battery that has no hourly or incremental cost) Could run generator 2 d