Pages that link to "Item:Q611703"

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

Displaying 28 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)
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times (Q552424) (← links)
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
• Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
• Single-machine scheduling with a nonlinear deterioration function (Q656605) (← links)
• Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
• Scheduling jobs under simple linear deterioration (Q1332800) (← 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)
• Single-machine scheduling with logarithm deterioration (Q1926617) (← links)
• The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176) (← links)
• Single-machine scheduling with accelerating deterioration effects (Q2448137) (← 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)
• Two models of single machine scheduling with general processing time functions (Q2886028) (← links)
• Single machine scheduling with time deteriorating job values (Q3505944) (← links)
• A multiple-criterion model for machine scheduling with constant deteriorating jobs (Q3513356) (← links)
• (Q3572159) (← links)
• Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
• (Q4927593) (← links)
• Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (Q6039898) (← links)
• Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm (Q6551161) (← links)