Pages that link to "Item:Q1010295"

The following pages link to Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295):

Displayed 16 items.

• Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects (Q336434) ‎ (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) ‎ (← links)
• Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) ‎ (← links)
• A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684) ‎ (← links)
• Scheduling problems with general effects of deterioration and learning (Q632713) ‎ (← links)
• Scheduling identical jobs on uniform parallel machines under position-based learning effects (Q1637750) ‎ (← links)
• Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (Q1667833) ‎ (← links)
• Due date single machine scheduling problems with nonlinear deterioration and learning effects and past sequence dependent setup times (Q1718923) ‎ (← links)
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) ‎ (← links)
• A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) ‎ (← links)
• An uncertain parallel machine problem with deterioration and learning effect (Q2322326) ‎ (← links)
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) ‎ (← links)
• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects (Q2629988) ‎ (← links)
• A new approach based on the learning effect for sequence-dependent parallel machine scheduling problem under uncertainty (Q2676000) ‎ (← 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 comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times (Q5058834) ‎ (← links)