Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
From MaRDI portal
Publication:3636744
DOI10.1080/00207540701725042zbMath1168.90655OpenAlexW2072435228MaRDI QIDQ3636744
Publication date: 29 June 2009
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701725042
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop ⋮ Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times ⋮ Scheduling multiple orders per job in a single machine to minimize total completion time ⋮ Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
Cites Work
- Scheduling batches on parallel machines with major and minor set-ups
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- The Batch Loading and Scheduling Problem
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- On the Complexity of Scheduling with Batch Setup Times
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Parallel Machine Scheduling with Batch Setup Times
This page was built for publication: Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
