A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
From MaRDI portal
Publication:835581
DOI10.1007/s10951-007-0049-1zbMath1168.90465MaRDI QIDQ835581
John W. Fowler, Hari Balasubramanian, Michele E. Pfund, Scott J. Mason, Oliver Rose
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0049-1
90B50: Management decision making, including multiple objectives
90B35: Deterministic scheduling theory in operations research
Related Items
A FUZZY-NEURAL FLUCTUATION SMOOTHING RULE FOR SCHEDULING JOBS WITH VARIOUS PRIORITIES IN A SEMICONDUCTOR MANUFACTURING FACTORY, Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem, A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival, Rule-based scheduling in wafer fabrication with due date-based objectives, Dynamic supply chain scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Job shop scheduling with setup times, deadlines and precedence constraints
- Multiple and bicriteria scheduling: A literature survey
- Extending the shifting bottleneck procedure to real-life applications
- Practical job shop scheduling
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Job shop scheduling with deadlines
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
- Decomposition methods for large job shops
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Multicriteria scheduling
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Multiple response optimization using mixture-designed experiments and desirability functions in semiconductor scheduling
- Heuristics for minimizing total weighted tardiness in complex job shops
- A modified shifting bottleneck procedure for job-shop scheduling
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling