![]() |
![]() |
University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Unpacking the tradeoff between completion time and energy consumption in scheduling: Solution Quality Metrics
Unpacking the tradeoff between completion time and energy consumption in scheduling: Solution Quality MetricsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Sergey Sergeev. Scheduling in manufacturing operations is traditionally assessed by service-oriented performance metrics such as the total time needed to complete the schedule (makespan). We incorporate the energy consumption as another key performance metric for scheduling operations and depict the trade-off between energy consumption and makespan on a two-machine sequence dependent permutation flowshop. For this purpose, we develop a mixed integer linear programming model and find the Pareto frontier corresponding to the two performance metrics using the epsilon-constraint approach. To cope with combinatorial complexity, we build a constructive heuristic for fast trade-off analysis between makespan and energy consumption. We design a set of experiments and assess the performance of constructive heuristic in comparison to CPLEX using four criteria: Distance with the Lower Bound (DLB), spacing (SPC), cardinality (CRD), and diversity (DVR). Our contribution is identifying where energy saving can be justified at reduced service level (longer makespan). This talk is part of the Optimisation and Numerical Analysis Seminars series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsType the title of a new list here School of Mathematics Events Midlands Logic SeminarOther talksSensing and metrology activities at NPL, India The development of an optically pumped magnetometer based MEG system Hodge Theory: Connecting Algebra and Analysis Quantum simulations using ultra cold ytterbium Geometry of alternating projections in metric spaces with bounded curvature Perfect matchings in random sparsifications of Dirac hypergraphs |