Pages that link to "Item:Q1603337"

The following pages link to Heuristics for hybrid flow shops with controllable processing times and assignable due dates (Q1603337):

Displaying 23 items.

• Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
• Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration (Q342119) (← links)
• Control methods for dynamic time-based manufacturing under customized product lead times (Q439459) (← links)
• Hybrid flowshop scheduling with machine and resource-dependent processing times (Q534872) (← links)
• Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
• A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
• Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Improved approximation algorithms for two-stage flexible flow shop scheduling (Q2025092) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Approximation algorithms for two-stage flexible flow shop scheduling (Q2292124) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163) (← links)
• Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem (Q2664314) (← links)
• Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem (Q3541175) (← links)
• Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds (Q5232862) (← links)
• Conceptual framework for lot-sizing and scheduling of flexible flow lines (Q5466729) (← links)
• Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation (Q5485056) (← links)