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 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)
- Scheduling one batch processor subject to job release dates (Q1582073) (← links)
- A new dynamic look-ahead scheduling procedure for batching machines (Q1600008) (← links)
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time (Q1628115) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost (Q1652653) (← links)
- Competitive project scheduling on two unbounded parallel batch machines (Q1656205) (← links)
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
- Scheduling and common due date assignment on a single parallel-batching machine with batch delivery (Q1723354) (← links)
- Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← 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)
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives (Q1788999) (← links)
- On scheduling an unbounded batch machine (Q1870002) (← links)
- Minimizing due date related performance measures on two batch processing machines (Q1873010) (← links)