Pages that link to "Item:Q497951"

The following pages link to A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951):

Displaying 8 items.

• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
• A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716) (← links)
• A two-agent single-machine scheduling problem to minimize the total cost with release dates (Q1701559) (← links)
• Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)
• Research on scheduling problems with general effects of deterioration and learning (Q1749104) (← links)
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
• Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects (Q2008062) (← links)
• A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)