Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
From MaRDI portal
Publication:1348547
DOI10.1016/S0305-0548(00)00098-8zbMath0995.90036OpenAlexW1974873411MaRDI QIDQ1348547
Publication date: 24 October 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00098-8
Related Items (10)
Improved mixed-integer linear programming model and heuristics for bi-objective single-machine batch scheduling with energy cost consideration ⋮ Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint ⋮ A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time ⋮ 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 random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
Cites Work
- Efficient scheduling algorithms for a single batch processing machine
- Scheduling with agreeable release times and due dates on a batch processing machine
- Stochastic scheduling of a batch processing machine with incompatible job families
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing total completion time on a batch processing machine with job families
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a single batch processing machine with non-identical job sizes
- The use of upstream and downstream information in scheduling semiconductor batch operations
- Scheduling batch processing machines with incompatible job families
- A neural network approach for batching decisions in wafer fabrication
- Scheduling Groups of Jobs on a Single Machine
- A General Class of Bulk Queues with Poisson Input
- Optimal control of batch service queues
This page was built for publication: Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
