Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom

Czibula, OG; Gu, H; Hwang, FJ; Kovalyov, MY; Zinder, Y

Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom

Czibula, OG

Gu, H

Hwang, FJ

Kovalyov, MY Zinder, Y

Permalink

Publication Type:: Journal Article
Citation:: Computers and Operations Research, 2016, 65 pp. 53 - 63
Issue Date:: 2016-07-25

Closed Access

	Filename	Description	Size
	Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (2016).pdf	Published Version	849.68 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Czibula, OG https://orcid.org/0000-0002-9788-9189	en_US
dc.contributor.author	Gu, H https://orcid.org/0000-0003-2035-2583	en_US
dc.contributor.author	Hwang, FJ https://orcid.org/0000-0002-1741-5590	en_US
dc.contributor.author	Kovalyov, MY	en_US
dc.contributor.author	Zinder, Y https://orcid.org/0000-0003-2024-8129	en_US
dc.date.issued	2016-07-25	en_US
dc.identifier.citation	Computers and Operations Research, 2016, 65 pp. 53 - 63	en_US
dc.identifier.issn	0305-0548	en_US
dc.identifier.uri	http://hdl.handle.net/10453/36627
dc.description.abstract	© 2015 Elsevier Ltd. Abstract In this paper, the problem of class formation and sequencing for multiple courses subject to a bottleneck classroom with an ordered bi-criteria objective is studied. The problem can be modelled as a single-machine batch scheduling problem with incompatible job families and parallel job processing in batches, where the batch size is family-dependent. For the minimisation of the number of tardy jobs, the strong NP-hardness is proven. For the performance measure of the maximum cost, we consider single criterion and bi-criteria cases. We present an O(<sup>n2</sup>logn) algorithm, n is the number of jobs, for both cases. An Integer Programming model as well as Simulated Annealing and Genetic Algorithm matheuristics to solve a fairly general case of the bi-criteria problem is presented and computationally tested.	en_US
dc.relation.ispartof	Computers and Operations Research	en_US
dc.relation.isbasedon	10.1016/j.cor.2015.06.010	en_US
dc.subject.classification	Operations Research	en_US
dc.title	Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom	en_US
dc.type	Journal Article
utslib.citation.volume	65	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0102 Applied Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
pubs.organisational-group	/University of Technology Sydney/Students
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	65	en_US

Abstract:

© 2015 Elsevier Ltd. Abstract In this paper, the problem of class formation and sequencing for multiple courses subject to a bottleneck classroom with an ordered bi-criteria objective is studied. The problem can be modelled as a single-machine batch scheduling problem with incompatible job families and parallel job processing in batches, where the batch size is family-dependent. For the minimisation of the number of tardy jobs, the strong NP-hardness is proven. For the performance measure of the maximum cost, we consider single criterion and bi-criteria cases. We present an O(ⁿ²logn) algorithm, n is the number of jobs, for both cases. An Integer Programming model as well as Simulated Annealing and Genetic Algorithm matheuristics to solve a fairly general case of the bi-criteria problem is presented and computationally tested.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/36627