Pages that link to "Item:Q924888"

The following pages link to The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888):

Displaying 9 items.

• Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827) (← links)
• A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
• Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
• Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
• Unbounded parallel-batching scheduling with two competitive agents (Q2434303) (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
• Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
• Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities (Q5270518) (← links)