Pages that link to "Item:Q4022933"
From MaRDI portal
The following pages link to Efficient Algorithms for Scheduling Semiconductor Burn-In Operations (Q4022933):
Displayed 24 items.
- Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING (Q3022023) (← links)
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes (Q3055315) (← links)
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE (Q3397511) (← links)
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855) (← links)
- A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM (Q3430322) (← links)
- Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines (Q3636744) (← links)
- Heuristic scheduling of jobs on a multi-product batch processing machine (Q4230214) (← links)
- Scheduling a single batch processing machine with non-identical job sizes (Q4394297) (← links)
- Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
- Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
- Integrated design approach for virtual production line-based reconfigurable manufacturing systems (Q4671293) (← links)
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
- Adaptive scheduling of batch servers in flow shops (Q4710093) (← links)
- Learning effective dispatching rules for batch processor scheduling (Q5385460) (← links)
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
- Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching (Q5438632) (← links)
- Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← links)
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)
- Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed (Q5952788) (← links)
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure (Q5959373) (← links)