Pages that link to "Item:Q878578"

The following pages link to A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578):

Displaying 25 items.

• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
• Integrated production and delivery on parallel batching machines (Q320081) (← 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)
• Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (Q833543) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• Minimizing makespan for multi-spindle head machines with a mobile table (Q954031) (← links)
• A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390) (← links)
• Order acceptance using genetic algorithms (Q1000954) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
• Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
• A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
• Revisit of the scheduling problems with integrated production and delivery on parallel batching machines (Q2039677) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← 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)
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
• Exact methods for the oven scheduling problem (Q6049438) (← links)
• Learning-augmented heuristics for scheduling parallel serial-batch processing machines (Q6164322) (← links)