Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0569.90063
Darby-Dowman, K.; Mitra, G.
An extension of set partitioning with application to scheduling problems. (English)
[J] Eur. J. Oper. Res. 21, 200-205 (1985). ISSN 0377-2217

The well-known problems of set covering, set partitioning and set packing are defined and their interrelationship is considered. A natural generalization called the extended set partitioning model is presented and the three standard models are shown to be special cases of this generalization. In addition, the extended model includes another type of set problem which can be of greater use in certain applications. The model forms the basis of a computer assisted bus crew scheduling system developed by the authors. The system is in regular use by Dublin City Services in the Republic of Ireland. Finally, the equivalence between a special case of the set partitioning problem and the shortest route problem is considered and it is shown that this equivalence also applies to the extended model.

MSC 2000:: *90C10 Integer programming
90B35 Scheduling theory
65K05 Mathematical programming (numerical methods)
90C35 Network programming

Keywords: goal programming; set covering; set partitioning; set packing; extended set partitioning; bus crew scheduling system; shortest route problem

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]