Pages that link to "Item:Q632684"

The following pages link to A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684):

Displaying 13 items.

• Single-machine scheduling with learning and forgetting effects (Q358103) (← links)
• 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) (← links)
• Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning'' (Q646155) (← links)
• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
• Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• Single-machine group scheduling problems with variable job processing times (Q1666514) (← links)
• A genetic algorithm-based approach for single-machine scheduling with learning effect and release time (Q1717946) (← links)
• Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153) (← links)
• Optimizing the supply chain configuration for make-to-order manufacturing (Q1926828) (← links)
• A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times (Q2798129) (← links)
• A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)
• Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect (Q6191395) (← links)