Minimizing Makespan in Batch Machine Scheduling
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs
Journal of Scheduling
Computers and Operations Research
Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
Theoretical Computer Science
On-line scheduling with delivery time on a single batch machine
Theoretical Computer Science
Bounded single-machine parallel-batch scheduling with release dates and rejection
Computers and Operations Research
Online scheduling on unbounded parallel-batch machines to minimize the makespan
Information Processing Letters
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
Information Processing Letters
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Information Processing Letters
Optimal on-line algorithms for one batch machine with grouped processing times
Journal of Combinatorial Optimization
Scheduling jobs on a flexible batching machine: model, complexity and algorithms
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Operations Research Letters
On scheduling an unbounded batch machine
Operations Research Letters
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
Theoretical Computer Science
| Hi-index | 0.05 |