Pages that link to "Item:Q4670270"

The following pages link to Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness (Q4670270):

Displaying 30 items.

• Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems (Q256691) (← links)
• Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
• Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing (Q342170) (← links)
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← links)
• Scheduling a hybrid flowshop with batch production at the last stage (Q875417) (← 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)
• 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)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
• Multiobjective scheduling of jobs with incompatible families on parallel batch machines (Q1742612) (← links)
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← links)
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
• Genetic algorithm for job scheduling with maintenance consideration in semiconductor manufacturing process (Q1955314) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Job scheduling of diffusion furnaces in semiconductor fabrication facilities (Q2140148) (← links)
• A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities (Q2222085) (← links)
• A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
• Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm (Q2403558) (← links)
• Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace (Q2656512) (← links)
• Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
• Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance (Q3163712) (← links)
• Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling (Q3498906) (← links)
• Artificial Intelligence and Soft Computing - ICAISC 2004 (Q4666408) (← links)
• A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
• Learning effective dispatching rules for batch processor scheduling (Q5385460) (← links)
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)
• Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows (Q5861097) (← links)
• Learning-augmented heuristics for scheduling parallel serial-batch processing machines (Q6164322) (← links)