Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
A better heuristic for preemptive parallel machine scheduling with batch setup times
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling with job release dates, delivery times and preemption penalties
Information Processing Letters
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
Journal of Scheduling
Lot-sizing scheduling with batch setup times
Journal of Scheduling
Selfish Scheduling with Setup Times
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Hi-index | 0.00 |