Pages that link to "Item:Q611703"

The following pages link to Single-machine scheduling with deteriorating functions for job processing times (Q611703):

Displaying 14 items.

• The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
• Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
• Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
• Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance (Q1666798) (← links)
• Single-machine scheduling problems with an actual time-dependent deterioration (Q1667852) (← links)
• Parallel machine scheduling with general sum of processing time based models (Q1675579) (← links)
• Scheduling problems with position dependent job processing times: computational complexity results (Q1761835) (← links)
• The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176) (← links)
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) (← links)
• Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
• Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration (Q2788531) (← links)
• Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (Q6039898) (← links)