Person:1577467

Available identifiers

zbMath Open wein.joel-mMaRDI QIDQ1577467

List of research outcomes

Publication	Date of Publication	Type
Scheduling jobs that arrive over time	2022-12-16	Paper
Task scheduling in networks	2022-12-09	Paper
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems	2012-06-08	Paper
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems	2006-09-14	Paper
Integer Programming and Combinatorial Optimization	2005-12-23	Paper
Techniques for scheduling with rejection	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q4818873	2004-09-24	Paper
Optimal time-critical scheduling via resource augmentation	2002-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q4526977	2001-02-28	Paper
Off-line admission control for general scheduling problems	2001-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4952713	2000-10-23	Paper
A 1. 47-approximation for a preemptive single-machine scheduling problem	2000-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4250213	2000-06-21	Paper
Minimizing average completion time in the presence of release dates	1999-06-03	Paper
Improved bounds on relaxations of a parallel machine scheduling problem	1999-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q3840374	1998-08-10	Paper
Task Scheduling in Networks	1998-02-09	Paper
On the existence of schedules that are near-optimal for both makespan and total weighted completion time	1998-01-12	Paper
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms	1997-10-28	Paper
Scheduling Parallel Machines On-Line	1996-09-15	Paper
https://portal.mardi4nfdi.de/entity/Q4875178	1996-04-28	Paper
Improved Approximation Algorithms for Shop Scheduling Problems	1994-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q3138949	1993-10-20	Paper
Approximating the minimum-cost maximum flow is P-complete	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q4010317	1992-09-27	Paper
Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems	1992-06-28	Paper

Research outcomes over time

This page was built for person: Joel M. Wein