Pages that link to "Item:Q4384087"

The following pages link to Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime (Q4384087):

Displaying 49 items.

• Integrated production and delivery on parallel batching machines (Q320081) (← links)
• Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← links)
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
• Model approximation for batch flow shop scheduling with fixed batch sizes (Q896496) (← links)
• Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
• The coordination of transportation and batching scheduling (Q965544) (← links)
• Scheduling a burn-in oven with non-agreeable release times and due dates (Q1019561) (← links)
• Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← 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)
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing (Q1579492) (← links)
• A PTAS for semiconductor burn-in scheduling (Q1774521) (← links)
• Minimizing due date related performance measures on two batch processing machines (Q1873010) (← links)
• Scheduling a batching machine with convex resource consumption functions (Q1944176) (← 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)
• Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Job scheduling of diffusion furnaces in semiconductor fabrication facilities (Q2140148) (← links)
• Mixed batch scheduling on identical machines (Q2197328) (← links)
• Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
• Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\) (Q2329630) (← links)
• Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
• Analysis of finite-buffer state-dependent bulk queues (Q2393119) (← links)
• Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
• Batch processing with interval graph compatibilities between tasks (Q2476244) (← links)
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← 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)
• 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)
• A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING (Q3021988) (← links)
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING (Q3022023) (← links)
• TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS (Q3069763) (← links)
• Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints (Q3098286) (← links)
• MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855) (← links)
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations (Q4022933) (← links)
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
• Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times (Q5444602) (← links)
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)
• A stochastic batching and scheduling problem (Q5890405) (← 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)