Pages that link to "Item:Q707142"

The following pages link to Minimizing number of tardy jobs on a batch processing machine with incompatible job families (Q707142):

Displaying 10 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)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← 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 makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
• Controlling job arrivals with processing time windows into batch processor buffer (Q763114) (← links)
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
• An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)