Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
From MaRDI portal
Publication:3636744
DOI10.1080/00207540701725042zbMATH Open1168.90655OpenAlexW2072435228MaRDI QIDQ3636744FDOQ3636744
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
Recommendations
- Integrated heuristics for scheduling multiple order jobs in a complex job shop
- Column generation heuristics for multiple machine, multiple orders per job scheduling problems
- Scheduling multiple orders per job with various constraints for hybrid flow shop
- scientific article
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling batches on parallel machines with major and minor set-ups
- On the Complexity of Scheduling with Batch Setup Times
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- The Batch Loading and Scheduling Problem
- Parallel Machine Scheduling with Batch Setup Times
Cited In (9)
- Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- Scheduling multiple orders per job in a single machine to minimize total completion time
- Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date
- Job order releasing and throughput planning for multi-priority orders in wafer fabs
- A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
- Scheduling of multiple in-line steppers for semiconductor wafer fabs
- A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop
This page was built for publication: Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636744)
