Pages that link to "Item:Q1579492"

The following pages link to Minimizing makespan on a single burn-in oven in semiconductor manufacturing (Q1579492):

Displaying 32 items.

• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
• Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← 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)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals (Q1348547) (← links)
• Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
• Realistic two-stage flowshop batch scheduling problems with transportation capacity and times (Q2428924) (← links)
• MIP formulations and heuristics for solving parallel batching problems (Q2429916) (← links)
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines (Q2486757) (← links)
• Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices (Q2954338) (← links)
• Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes (Q3055315) (← links)
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM (Q3430322) (← links)
• Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
• A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
• Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times (Q5444602) (← links)
• Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed (Q5952788) (← links)
• Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)
• Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
• A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)