Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing
From MaRDI portal
Publication:6151475
DOI10.1080/0305215x.2022.2124406MaRDI QIDQ6151475
Publication date: 12 February 2024
Published in: Engineering Optimization (Search for Journal in Brave)
schedulingflow shopheuristic algorithmsemiconductor manufacturingwaiting time constraintsmissing operations
Cites Work
- Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Two-machine flow shop scheduling problems with minimal and maximal delays
- Modeling realistic hybrid flexible flowshop scheduling problems
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Three-machine flow shop scheduling with overlapping waiting time constraints
- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
- Transient Analysis of Serial Production Lines With Perishable Products: Bernoulli Reliability Model
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Total Tardiness Problem: Review and Extensions
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time
- A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimization
- Make-to-order scheduling in foundry semiconductor fabrication
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs