Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
From MaRDI portal
Publication:342113
DOI10.1016/J.COR.2015.06.010zbMATH Open1349.90332OpenAlexW1143698237MaRDI QIDQ342113FDOQ342113
Hanyu Gu, Yakov Zinder, M. Y. Kovalyov, F. J. Hwang, Oliver G. Czibula
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.06.010
Recommendations
Cites Work
- Optimization by Simulated Annealing
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Scheduling a batching machine
- Single Machine Group Scheduling with Two Ordered Criteria
- Multicriteria scheduling
- Scheduling batch processing machines with incompatible job families
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Title not available (Why is that?)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Single machine group scheduling with ordered criteria
- Sequencing with ordered criteria, precedence and group technology constraints
- The Batch Loading and Scheduling Problem
- Bicriterion scheduling with equal processing times on a batch processing machine
Cited In (1)
Uses Software
This page was built for publication: Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342113)