Pages that link to "Item:Q991390"

The following pages link to A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival (Q991390):

Displaying 10 items.

• Modeling the dynamics of a multi-product manufacturing system: a real case application (Q319423) (← links)
• Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing (Q342170) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
• A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← 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)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← 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)
• A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)