Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
From MaRDI portal
Publication:3636744
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; zbMATH DE number 6611746
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
Cites work
- 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
- 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
- Parallel Machine Scheduling with Batch Setup Times
- Scheduling batches on parallel machines with major and minor set-ups
- The Batch Loading and Scheduling Problem
Cited in
(16)- 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
- Integrated heuristics for scheduling multiple order jobs in a complex job shop
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- Parallel machine scheduling with time constraints on machine qualifications
- Column generation heuristics for multiple machine, multiple orders per job scheduling problems
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
- Multiple orders per job batch scheduling with incompatible jobs
- Scheduling multiple orders per job in a single machine to minimize total completion time
- Scheduling job families on non-identical parallel machines with time constraints
- 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
- Scheduling multiple orders per job with various constraints for hybrid flow shop
- 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)
