Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of LP-based approximation algorithms for scheduling problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Approximation schemes for preemptive weighted flow time
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine
Journal of Heuristics
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
INFORMS Journal on Computing
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
Coalition Formation: From Software Agents to Robots
Journal of Intelligent and Robotic Systems
Lagrangian bounds for just-in-time job-shop scheduling
Computers and Operations Research
Preemption in single machine earliness/tardiness scheduling
Journal of Scheduling
Computation of approximate α-points for large scale single machine scheduling problem
Computers and Operations Research
A Global Constraint for Total Weighted Completion Time
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Mixed integer programming formulations for single machine scheduling problems
Computers and Industrial Engineering
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
INFORMS Journal on Computing
Optimal Real-Time Traffic Control in Metro Stations
Operations Research
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An exact algorithm for single-machine scheduling without machine idle time
Journal of Scheduling
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
A family of inequalities valid for the robust single machine scheduling polyhedron
Computers and Operations Research
Integrated requirement selection and scheduling for the release planning of a software product
REFSQ'07 Proceedings of the 13th international working conference on Requirements engineering: foundation for software quality
Computers and Industrial Engineering
Fuzzy batching scheduling problem and its heuristics
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 6
Solving the single-machine sequencing problem using integer programming
Computers and Industrial Engineering
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
Computers and Operations Research
Computers and Operations Research
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters
Operations Research Letters
GUB Covers and Power-Indexed Formulations for Wireless Network Design
Management Science
Single machine batch scheduling with release times and delivery costs
Journal of Scheduling
A linear programming-based method for job shop scheduling
Journal of Scheduling
Two dimensional optimal mechanism design for a sequencing problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |