Pages that link to "Item:Q1761835"

The following pages link to Scheduling problems with position dependent job processing times: computational complexity results (Q1761835):

Displaying 34 items.

• Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837) (← links)
• Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
• Strong NP-hardness of scheduling problems with learning or aging effect (Q363599) (← links)
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
• The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
• Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time (Q727300) (← links)
• The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
• A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
• Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date (Q1659271) (← links)
• A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing (Q1730499) (← links)
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (Q1730596) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
• Multitasking scheduling problems with deterioration effect (Q1992785) (← links)
• Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
• Machine scheduling problems with a position-dependent deterioration (Q2010053) (← links)
• Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads (Q2075458) (← links)
• Approximation algorithms for some position-dependent scheduling problems (Q2217459) (← links)
• Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
• The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176) (← links)
• Two-agent scheduling problems with the general position-dependent processing time (Q2333788) (← links)
• A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects (Q2337180) (← links)
• Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
• Scheduling problems with learning and ageing effects: a survey (Q2902364) (← links)
• Scheduling jobs with linear model of simultaneous ageing and learning effects (Q2902366) (← links)
• (Q3809574) (← links)
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE (Q4649880) (← links)
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (Q5059190) (← links)
• Scheduling with a position-weighted learning effect and job release dates (Q5059418) (← links)
• Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)
• A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect (Q5255177) (← links)
• Complexity results for single-machine scheduling with positional learning effects (Q5447775) (← links)
• (Q6068238) (← links)