Pages that link to "Item:Q5058932"

The following pages link to Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint (Q5058932):

Displaying 29 items.

• A unified analysis for scheduling problems with variable processing times (Q2076372) (← links)
• Resource allocation scheduling with deteriorating jobs and position-dependent workloads (Q2097458) (← links)
• Scheduling jobs with general truncated learning effects including proportional setup times (Q2140779) (← links)
• Less is more approach for competing groups scheduling with different learning effects (Q2292126) (← links)
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
• Study on resource allocation scheduling problem with learning factors and group technology (Q2691328) (← links)
• A maintenance activity scheduling with time-and-position dependent deteriorating effects (Q2693623) (← links)
• Solving a new robust green cellular manufacturing problem with environmental issues under uncertainty using Benders decomposition (Q5059189) (← links)
• Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
• Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups (Q5059220) (← links)
• Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255) (← links)
• Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation (Q5059285) (← links)
• Research on common due window assignment flowshop scheduling with learning effect and resource allocation (Q5059340) (← links)
• A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration (Q5059372) (← links)
• Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology (Q5059395) (← links)
• A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
• Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights (Q5149554) (← links)
• Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects (Q5216798) (← links)
• Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times (Q5865915) (← links)
• Scheduling with deterioration effects and maintenance activities under parallel processors (Q6048066) (← links)
• Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects (Q6053522) (← links)
• A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation (Q6094364) (← links)
• Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times (Q6094482) (← links)
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine (Q6094568) (← links)
• Optimization of scheduling problems with deterioration effects and an optional maintenance activity (Q6116026) (← links)
• Single machine slack due window assignment and deteriorating jobs (Q6149338) (← links)
• Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs (Q6542459) (← links)
• Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations (Q6584755) (← links)
• Supply chain scheduling with deteriorating jobs and delivery times (Q6584776) (← links)