When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Greedy Approach for a Time-Dependent Scheduling Problem
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
Computers and Operations Research
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Scheduling linear deteriorating jobs with an availability constraint on a single machine
Theoretical Computer Science
Single machine group scheduling under decreasing linear deterioration
Journal of Applied Mathematics and Computing
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
Computers and Operations Research
Parallel-machine scheduling with time dependent processing times
Theoretical Computer Science
Parallel machine scheduling problems with proportionally deteriorating jobs
International Journal of Systems Science
Single machine parallel-batch scheduling with deteriorating jobs
Theoretical Computer Science
Two-machine flow shop scheduling with linear decreasing job deterioration
Computers and Industrial Engineering
Single machine scheduling with decreasing linear deterioration under precedence constraints
Computers & Mathematics with Applications
Parallel-machine scheduling of simple linear deteriorating jobs
Theoretical Computer Science
Two-machine flow shop problem with effects of deterioration and learning
Computers and Industrial Engineering
Single-machine scheduling with learning effect and deteriorating jobs
Computers and Industrial Engineering
Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
Computers and Operations Research
Preemptive scheduling with simple linear deterioration on a single machine
Theoretical Computer Science
Parallel-machine scheduling with deteriorating jobs and rejection
Theoretical Computer Science
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times
Computers and Industrial Engineering
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
Information Processing Letters
Heuristics for parallel machine scheduling with deterioration effect
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Parallel machine scheduling of deteriorating jobs by modified steepest descent search
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Scheduling to minimize makespan with time-dependent processing times
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
Journal of Combinatorial Optimization
Online makespan scheduling of linear deteriorating jobs on parallel machines
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
Theoretical Computer Science
Approximation algorithms for parallel machine scheduling with linear deterioration
Theoretical Computer Science
| Hi-index | 0.05 |