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.
- Scheduling with batching: A review (Q1969826) (← links)
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines (Q1969905) (← links)
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261) (← links)
- Batch scheduling with proportional-linear deterioration and outsourcing (Q1992948) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
- Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- On lower and upper bounds for single machine parallel batch scheduling (Q2091210) (← links)
- Learning-based multi-objective evolutionary algorithm for batching decision problem (Q2108120) (← links)
- Online scheduling on a parallel batch machine with delivery times and limited restarts (Q2136511) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan (Q2268765) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580) (← links)
- Logic-based Benders decomposition for scheduling a batching machine (Q2333133) (← links)
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
- Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
- Online unbounded batch scheduling on parallel machines with delivery times (Q2354308) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- Minimizing total completion time on a batch processing machine with job families (Q2367392) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- Realistic two-stage flowshop batch scheduling problems with transportation capacity and times (Q2428924) (← links)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
- Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
- Minimizing makespan on a single batching machine with release times and non-identical job sizes (Q2488218) (← links)
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← 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)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint (Q2657417) (← links)
- Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
- Semiconductor final-test scheduling under setup operator constraints (Q2669721) (← links)
- Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
- Minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2741217) (← links)
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries (Q2867109) (← links)
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices (Q2954338) (← links)
- Batch-size-based rearrangement of the shop floor into mini-lines (Q2967580) (← links)