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.
- 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)
- 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)
- Single machine batch scheduling with release times (Q732326) (← 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)
- 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)
- Scheduling one batch processor subject to job release dates (Q1582073) (← links)
- A new dynamic look-ahead scheduling procedure for batching machines (Q1600008) (← links)
- A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← links)
- Order consolidation for batch processing (Q1774533) (← links)
- Minimizing makespan with release times on identical parallel batching machines (Q1775064) (← links)
- On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- Minimizing due date related performance measures on two batch processing machines (Q1873010) (← links)
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
- Earliness and tardiness scheduling problems on a batch processor (Q1961238) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines (Q1969905) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
- Minimizing total completion time on a batch processing machine with job families (Q2367392) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- Minimizing makespan on a single batching machine with release times and non-identical job sizes (Q2488218) (← links)
- The master-slave paradigm in parallel computer and industrial settings (Q2564882) (← links)
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine (Q2576877) (← links)
- Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
- Minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2741217) (← links)