Pages that link to "Item:Q4022933"
From MaRDI portal
The following pages link to Efficient Algorithms for Scheduling Semiconductor Burn-In Operations (Q4022933):
Displayed 50 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Integrated production and delivery on parallel batching machines (Q320081) (← links)
- The lockmaster's problem (Q322695) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- Batch sequencing and cooperation (Q398862) (← links)
- Optimal on-line algorithms for one batch machine with grouped processing times (Q411231) (← links)
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) (← links)
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
- A note on unbounded parallel-batch scheduling (Q495685) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
- Online batch scheduling on parallel machines with delivery times (Q719274) (← links)
- Single machine batch scheduling with release times (Q732326) (← links)
- Controlling job arrivals with processing time windows into batch processor buffer (Q763114) (← links)
- The coordination of scheduling and batch deliveries (Q816348) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← links)
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
- Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (Q905848) (← links)
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
- The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
- Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs (Q988377) (← links)
- Optimal online-list batch scheduling (Q990939) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
- On-line scheduling with delivery time on a single batch machine (Q1022586) (← links)
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
- Scheduling with agreeable release times and due dates on a batch processing machine (Q1278533) (← links)
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals (Q1348547) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing (Q1579492) (← links)