Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
From MaRDI portal
(Redirected from Publication:1348547)
Recommendations
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a burn-in oven with non-agreeable release times and due dates
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
Cites work
- A General Class of Bulk Queues with Poisson Input
- A neural network approach for batching decisions in wafer fabrication
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing total completion time on a batch processing machine with job families
- Optimal control of batch service queues
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling with agreeable release times and due dates on a batch processing machine
- Stochastic scheduling of a batch processing machine with incompatible job families
- The use of upstream and downstream information in scheduling semiconductor batch operations
Cited in
(17)- Scheduling a burn-in oven with non-agreeable release times and due dates
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Makespan minimization on single batch-processing machine via ant colony optimization
- A survey of scheduling with parallel batch (p-batch) processing
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
- Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Dynamic scheduling of batch servers with compatible product families
- Improved mixed-integer linear programming model and heuristics for bi-objective single-machine batch scheduling with energy cost consideration
- Exact approaches for single machine total weighted tardiness batch scheduling
- Exact methods for the oven scheduling problem
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
This page was built for publication: Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348547)
