Optimal Scheduling of Jobs on a Transmission Network

G. A. Jones and J. G. Wilson
Additional contact information
G. A. Jones: Central Electricity Generating Board, London
J. G. Wilson: British Gas Corporation, London

Management Science, 1979, vol. 25, issue 1, 98-104

Abstract: A number of jobs have to be carried out on a gas transmission network every year, which restrict the transmission capacity of the network while they are in progress. There are certain pairs of jobs which must not be in progress at the same time. The network must meet a convex annual demand pattern. The problem of scheduling the jobs over the summer construction period to meet these conditions is formulated as a mixed-integer linear programming problem which is solved by a branch-and-bound algorithm. Results and benefits to the operators of the network are described.

Keywords: programming: integer; applications; facilities/equipment planning: maintenance/replacement; production/scheduling (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.1.98 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:1:p:98-104

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().