Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
From MaRDI portal
Publication:940867
DOI10.1007/s10479-007-0273-2zbMath1152.90471OpenAlexW1964946688MaRDI QIDQ940867
Erhan Kutanoglu, Fehmi Tanrisever
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0273-2
Related Items (4)
Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Some results of the worst-case analysis for flow shop scheduling with a learning effect ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
Uses Software
Cites Work
- Unnamed Item
- Batch sizing and job sequencing on a single machine
- The complexity of one-machine batching problems
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
- Scheduling with batching: A review
- Minimizing total completion time on a batch processing machine with job families
- Combinatorial optimization. Theory and applications.
- The Batch Loading and Scheduling Problem
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Managing batch processors to reduce lead time in a semiconductor packaging line
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling batch processing machines with incompatible job families
- Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
This page was built for publication: Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
