Pages that link to "Item:Q1302577"

The following pages link to Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment (Q1302577):

Displaying 12 items.

• Scheduling with flexible resources in parallel workcenters to minimize maximum completion time (Q850309) (← links)
• Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs (Q858442) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• An analysis of heuristics for the parallel-machine flexible-resource scheduling problem (Q1374455) (← links)
• Algorithms for the unrelated parallel machine scheduling problem with a resource constraint (Q1653364) (← links)
• Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
• Production, maintenance and resource scheduling: a review (Q2098022) (← links)
• A sequencing approach for creating new train timetables (Q2267382) (← links)
• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
• A new model and algorithm for uncertain random parallel machine scheduling problem (Q2318555) (← links)
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)