WO2004038566A2 - Demand-based resource scheduling method and system - Google Patents

Demand-based resource scheduling method and system

Info

Publication number
WO2004038566A2
WO2004038566A2 PCT/US2003/034496 US0334496W WO2004038566A2 WO 2004038566 A2 WO2004038566 A2 WO 2004038566A2 US 0334496 W US0334496 W US 0334496W WO 2004038566 A2 WO2004038566 A2 WO 2004038566A2
Authority
WO
WIPO (PCT)
Prior art keywords
resources
demand
scheduling method
resource scheduling
based resource
Prior art date
Application number
PCT/US2003/034496
Other languages
French (fr)
Other versions
WO2004038566A3 (en
Inventor
Wolf Kohn
Vladimir M. Brayman
Original Assignee
Hynomics Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hynomics Corporation filed Critical Hynomics Corporation
Priority to AU2003291662A priority Critical patent/AU2003291662A1/en
Publication of WO2004038566A2 publication Critical patent/WO2004038566A2/en
Publication of WO2004038566A3 publication Critical patent/WO2004038566A3/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Definitions

  • the present invention relates to optimization methodologies and, in particular, to a method and system for encoding a class of constrained optimization problems, and then employing a generic, meta-level, iterative optimization technique to solve the encoded class of constrained optimization problems.
  • the present invention provides a method and system that produces a near-optimum schedule in linear time by providing an optimal resource ordering scheme.
  • the present invention is embodied in a computer program that, using a state vector definition and a defined cost-go-go function, optimally orders resources for scheduling.
  • V(y,k) mm ⁇ V(y(t) + u w k (t)),k + l ⁇
  • Optimal ordering of resources is based on the following weighting function: where ⁇ ⁇ and ⁇ 2 are relative weight coefficients, f[ is a variable that defines how a user values resource i, and f 2 is a variable that defines an actual cost of resource i.
  • the resources are arranged based on the respective values of the weighting function in such a way that the resources with the smallest values go first.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Educational Administration (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention provides a method and system that produces a near-optimum schedule in linear time by providing an optimal resource ordering scheme. The present invention is embodied in a scheduling computer program.

Description

METHOD AND SYSTEM FOR ENCODING AND FAST-CONVERGENT SOLVING GENERAL CONSTRAINED SYSTEMS
CROSS-REFERENCE TO RELATED APPLICATION
This application claims the benefit of provisional patent application no.
60/420,920, filed October 23, 2002.
TECHNICAL FIELD
The present invention relates to optimization methodologies and, in particular, to a method and system for encoding a class of constrained optimization problems, and then employing a generic, meta-level, iterative optimization technique to solve the encoded class of constrained optimization problems.
BACKGROUND OF THE INVENTION
It is well known that scheduling of scarce nonrenewable resources subjected to constraints is an NP-hard problem. Suppose that there is a set of tasks W nd there is a set of N resources that can be assigned to tasks w e W. The problem that needs to be addressed is to schedule the N resources among the W tasks in an optimal or near optimal manner. Assume uw' (t) to be a piecewise constant function of the assignment of resources i to task w. Assume dw(t) to be a piecewise constant function of the demand for resources for task w. Then the optimization problem is as follows:
Figure imgf000002_0001
where cw(t) is a time-varying cost of not satisfying demand for task w.
SUMMARY OF THE INVENTION The present invention provides a method and system that produces a near-optimum schedule in linear time by providing an optimal resource ordering scheme. DETAILED DESCRIPTION OF THE INVENTION
The present invention is embodied in a computer program that, using a state vector definition and a defined cost-go-go function, optimally orders resources for scheduling.
Define a state vector xw k(t) as follows:
Figure imgf000003_0001
we W The optimization problem described above then becomes: mm (xw N(ή)
«!,.(') ", subject to the above definition for xw k (t) where
Figure imgf000003_0002
Define a cost-to-go function V{x^(t),k)
Figure imgf000003_0003
χ w (t) = y(t)
Then by Bellman's principle of optimality,
V(y,k) = mm{V(y(t) + uw k(t)),k + l}
Figure imgf000003_0004
Optimal ordering of resources is based on the following weighting function:
Figure imgf000003_0005
where ζλ and ζ2 are relative weight coefficients, f[ is a variable that defines how a user values resource i, and f2 is a variable that defines an actual cost of resource i. The resources are arranged based on the respective values of the weighting function in such a way that the resources with the smallest values go first.

Claims

A method for scheduling scare, nonrenewable resources, the method comprising: defining a state vector; defining a cost-to-go function; and using Bellman's principle of optimality, optimizing the scheduling by optimally ordering the resources by a weighting function.
PCT/US2003/034496 2002-10-23 2003-10-23 Demand-based resource scheduling method and system WO2004038566A2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2003291662A AU2003291662A1 (en) 2002-10-23 2003-10-23 Demand-based resource scheduling method and system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US42092002P 2002-10-23 2002-10-23
US60/420,920 2002-10-23

Publications (2)

Publication Number Publication Date
WO2004038566A2 true WO2004038566A2 (en) 2004-05-06
WO2004038566A3 WO2004038566A3 (en) 2009-06-18

Family

ID=32176650

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2003/034496 WO2004038566A2 (en) 2002-10-23 2003-10-23 Demand-based resource scheduling method and system

Country Status (2)

Country Link
AU (1) AU2003291662A1 (en)
WO (1) WO2004038566A2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2232343B1 (en) 2007-12-20 2017-10-11 Vestas Wind Systems A/S A method for controlling a common output from at least two wind turbines, a central wind turbine control system, a wind park and a cluster of wind parks

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4744028A (en) * 1985-04-19 1988-05-10 American Telephone And Telegraph Company, At&T Bell Laboratories Methods and apparatus for efficient resource allocation
US4924386A (en) * 1987-07-13 1990-05-08 American Telephone And Telegraph Company Methods and apparatus for efficient resource allocation
US5077661A (en) * 1989-05-03 1991-12-31 Hewlett-Packard Company Assignment-dependent resource allocation method
US6633854B1 (en) * 1999-11-05 2003-10-14 Genuity Inc. System and method for analyzing genertic algorithms

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4744028A (en) * 1985-04-19 1988-05-10 American Telephone And Telegraph Company, At&T Bell Laboratories Methods and apparatus for efficient resource allocation
US4924386A (en) * 1987-07-13 1990-05-08 American Telephone And Telegraph Company Methods and apparatus for efficient resource allocation
US5077661A (en) * 1989-05-03 1991-12-31 Hewlett-Packard Company Assignment-dependent resource allocation method
US6633854B1 (en) * 1999-11-05 2003-10-14 Genuity Inc. System and method for analyzing genertic algorithms

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2232343B1 (en) 2007-12-20 2017-10-11 Vestas Wind Systems A/S A method for controlling a common output from at least two wind turbines, a central wind turbine control system, a wind park and a cluster of wind parks

Also Published As

Publication number Publication date
AU2003291662A8 (en) 2009-07-30
AU2003291662A1 (en) 2004-05-13
WO2004038566A3 (en) 2009-06-18

Similar Documents

Publication Publication Date Title
CN109582448B (en) Criticality and timeliness oriented edge calculation task scheduling method
Kubiak et al. A note on
Cattrysse et al. A set partitioning heuristic for the generalized assignment problem
WO2003052597A3 (en) Data processing system having multiple processors and task scheduler and corresponding method therefore
Matanachai et al. Balancing mixed-model assembly lines to reduce work overload
EP1288748A3 (en) Controller and operating system
DE60235618D1 (en) DATA TRANSMISSIONS IN A WIRELESS COMMUNICATION SYSTEM
CN103838627B (en) Workflow dispatching method based on workflow throughput maximization
CN103235835B (en) For the inquiry implementation method and device of data-base cluster
WO2007117757A3 (en) Scheduling in wireless communication systems
MXPA04009210A (en) A method and system of mass and multiple casualty triage.
EP0880095A3 (en) Resource scheduler
EP1473652A3 (en) Predictive and preemptive planning and scheduling for different job priorities system and method
EP1536658A3 (en) Opportunistic beamforming and scheduling of users in a communication system
CN112231085B (en) Mobile terminal task migration method based on time perception in collaborative environment
CN109005211B (en) Micro-cloud deployment and user task scheduling method in wireless metropolitan area network environment
CN103077083A (en) Method and system for processing tasks
CN113115459A (en) Multi-scale and multi-dimensional resource allocation method for power Internet of things mass terminal
US20150372484A1 (en) Smart grid system and resource distribution method therein
WO2004038566A2 (en) Demand-based resource scheduling method and system
ATE548690T1 (en) METHOD AND SYSTEM FOR IMPROVING SATELLITE GATEWAY COMMUNICATIONS
US20040143617A1 (en) Method and system for encoding and fast-convergent solving general constrained systems
CN109978322A (en) A kind of multi-stage scheduling method based on global optimization
CN103077438A (en) Control method and system for scheduling multiple robots
CN116700173A (en) Dynamic scheduling method of production line based on graph representation learning

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase in:

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP