When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Industrial Engineering
Open shop scheduling problems with late work criteria
Discrete Applied Mathematics
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
Computers and Industrial Engineering
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Theoretical Computer Science
Late work minimization in a small flexible manufacturing system
Computers and Industrial Engineering
Computers and Operations Research
Scheduling imprecise computation tasks on uniform processors
Information Processing Letters
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
Computers and Industrial Engineering
Late work minimization in flow shops by a genetic algorithm
Computers and Industrial Engineering
Metaheuristics for late work minimization in two-machine flow shop with common due date
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
A note on a single machine scheduling problem with generalized total tardiness objective function
Information Processing Letters
Improving the complexities of approximation algorithms for optimization problems
Operations Research Letters
Approximation algorithms for scheduling a single machine to minimize total late work
Operations Research Letters
Hi-index | 0.00 |