Pages that link to "Item:Q4399080"

The following pages link to Scheduling batch processing machines with incompatible job families (Q4399080):

Displaying 44 items.

• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
• Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
• Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
• On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142) (← links)
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
• Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
• Multiple orders per job batch scheduling with incompatible jobs (Q940891) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390) (← links)
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals (Q1348547) (← links)
• Scheduling job shops with batch machines using the Lagrangian relaxation technique (Q1383473) (← links)
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing (Q1579492) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
• Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← 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)
• Two-stage hybrid flow shop scheduling with dynamic job arrivals (Q1762160) (← links)
• Order consolidation for batch processing (Q1774533) (← links)
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
• A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
• Earliness and tardiness scheduling problems on a batch processor (Q1961238) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Mixed batch scheduling on identical machines (Q2197328) (← 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)
• Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace (Q2656512) (← links)
• Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
• Scheduling with product family set-up times: an application in TFT LCD manufacturing (Q4671319) (← links)
• A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Learning effective dispatching rules for batch processor scheduling (Q5385460) (← links)
• Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← 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)
• 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)
• Exact methods for the oven scheduling problem (Q6049438) (← links)