Efficient algorithms for scheduling semiconductor burn-in operations

Set management: minimizing synchronization delays of prefabricated parts before assembly

WSC '95 Proceedings of the 27th conference on Winter simulation

Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

Computers and Operations Research

Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure

Computers and Operations Research

Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals

Computers and Operations Research

A genetic algorithm to minimize maximum lateness on a batch processing machine

Computers and Operations Research

Approximation Algorithms in Batch Processing

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation

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

A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

Theoretical Computer Science

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science

Minimizing total weighted tardiness on a single batch process machine with incompatible job families

Computers and Operations Research

Note: minimizing makespan with release times on identical parallel batching machines

Discrete Applied Mathematics

Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine

Theoretical Computer Science

Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times

Computers and Operations Research

Scheduling a capacitated batch-processing machine to minimize makespan

Robotics and Computer-Integrated Manufacturing

A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

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

Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

Computers and Operations Research

A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research

Note: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Theoretical Computer Science

Bicriterion scheduling with equal processing times on a batch processing machine

Computers and Operations Research

Modeling semiconductor testing job scheduling and dynamic testing machine configuration

Expert Systems with Applications: An International Journal

Scheduling hybrid flowshop with parallel batching machines and compatibilities

Computers and Operations Research

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Journal of Heuristics

Single machine parallel-batch scheduling with deteriorating jobs

Theoretical Computer Science

On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

Journal of Scheduling

Technology that upsets the social order: a paradigm shift in assigning lots to tools in a wafer fabricator -- the transition from rules to optimization

Proceedings of the 40th Conference on Winter Simulation

Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

Optimal online-list batch scheduling

Information Processing Letters

Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics

Expert Systems with Applications: An International Journal

Note: Minimizing makespan with release times on identical parallel batching machines

Discrete Applied Mathematics

Scheduling an unbounded batch machine to minimize maximum lateness

FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics

An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes

Engineering Applications of Artificial Intelligence

Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints

Operations Research

Parallel batch scheduling of equal-length jobs with release and due dates

Journal of Scheduling

Bounded parallel-batch scheduling on unrelated parallel machines

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management

Tabu search heuristic for two-machine flowshop with batch processing machines

Computers and Industrial Engineering

Best semi-online algorithms for unbounded parallel batch scheduling

Discrete Applied Mathematics

Unbounded parallel-batch scheduling with family jobs and delivery coordination

Information Processing Letters

Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

Information Processing Letters

Makespan minimization on single batch-processing machine via ant colony optimization

Computers and Operations Research

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

Computers and Operations Research

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times

Information Processing Letters

Optimal on-line algorithms for one batch machine with grouped processing times

Journal of Combinatorial Optimization

Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm

Applied Soft Computing

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

A PTAS for scheduling on agreeable unrelated parallel batch processing machines with dynamic job arrivals

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management

Online single machine batch scheduling

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Journal of Scheduling

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times

Discrete Applied Mathematics

Dynamic scheduling problem of batch processing machine in semiconductor burn-in operations

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Unbounded parallel batch scheduling with job delivery to minimize makespan

Operations Research Letters

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Operations Research Letters

An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

Operations Research Letters

Minimizing total completion time on a batch processing machine with job families

Operations Research Letters

Minimizing makespan on a single batching machine with release times and non-identical job sizes

Operations Research Letters

On scheduling an unbounded batch machine

Operations Research Letters

Unbounded parallel-batching scheduling with two competitive agents

Journal of Scheduling

Scheduling of deteriorating jobs with release dates to minimize the maximum lateness

Theoretical Computer Science

An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes

Applied Soft Computing

Bounded parallel-batching scheduling with two competing agents

Journal of Scheduling

Batch sequencing and cooperation

Journal of Scheduling

Optimal batch schedules for parallel machines

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Scheduling unrelated parallel batch processing machines with non-identical job sizes

Computers and Operations Research