Gilbert H. Young

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Single-vehicle scheduling problem on a straight line with time window constraints Lecture Notes in Computer Science	2023-12-12	Paper
Preemptive multiprocessor order scheduling to minimize total weighted flowtime European Journal of Operational Research	2008-04-24	Paper
scientific article; zbMATH DE number 1934401 (Why is no real title available?)	2003-08-25	Paper
Analysis on extended ant routing algorithms for network routing and management The Journal of Supercomputing	2003-08-20	Paper
scientific article; zbMATH DE number 1934389 (Why is no real title available?)	2003-06-24	Paper
An effective quasi-human based heuristic for solving the rectangle packing problem European Journal of Operational Research	2002-11-17	Paper
scientific article; zbMATH DE number 1750105 (Why is no real title available?)	2002-11-06	Paper
A note on an open-end bin packing problem Journal of Scheduling	2001-10-14	Paper
scientific article; zbMATH DE number 1555982 (Why is no real title available?)	2001-01-24	Paper
scientific article; zbMATH DE number 1529472 (Why is no real title available?)	2000-11-14	Paper
Single-vehicle scheduling with time window constraints Journal of Scheduling	1999-09-12	Paper
Lower bounds for dynamic tree embedding in bipartite networks Journal of Parallel and Distributed Computing	1999-01-06	Paper
Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk Journal of Parallel and Distributed Computing	1998-11-01	Paper
scientific article; zbMATH DE number 434689 (Why is no real title available?)	1994-05-30	Paper
scientific article; zbMATH DE number 140089 (Why is no real title available?)	1993-03-28	Paper
Minimizing Total Tardiness on a Single Machine with Precedence Constraints ORSA Journal on Computing	1993-02-18	Paper
Scheduling chain-structured tasks to minimize makespan and mean flow time Information and Computation	1992-06-25	Paper
Preemptive scheduling to minimize mean weighted flow time Information Processing Letters	1990-01-01	Paper
Minimizing mean flow time with release time constraint Theoretical Computer Science	1990-01-01	Paper
Minimizing Schedule Length Subject to Minimum Flow Time SIAM Journal on Computing	1989-01-01	Paper

Research outcomes over time

This page was built for person: Gilbert H. Young