Scheduling problems with position dependent job processing times: computational complexity results
From MaRDI portal
Recommendations
- Scheduling jobs with linear model of simultaneous ageing and learning effects
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Single-machine scheduling problems with an aging effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- A Theory of the Learning Process
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- A concise survey of scheduling with time-dependent processing times
- A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A state-of-the-art review on scheduling with learning effects
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs under an aging effect
- Scheduling jobs with position-dependent processing times
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
- Scheduling problems with general effects of deterioration and learning
- Single machine scheduling with learning effect considerations
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Single-machine scheduling problems with time and position dependent processing times
- Single-machine scheduling with both deterioration and learning effects
- Single-machine scheduling with deteriorating functions for job processing times
- Single-machine scheduling with learning considerations
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Time-dependent scheduling
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
Cited in
(35)- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Multitasking scheduling problems with deterioration effect
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases
- A scheduling problem with job values given as a power function of their completion times
- A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Scheduling problems with learning and ageing effects: a survey
- A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
- Hybrid optimization methods for time-dependent sequencing problems
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
- Approximation algorithms for some position-dependent scheduling problems
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Two-agent scheduling problems with the general position-dependent processing time
- Single-machine scheduling problems with an aging effect
- Parallel-machine scheduling with maintenance: praising the assignment problem
- Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
- The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard
- Scheduling with a position-weighted learning effect and job release dates
- Polyhedral results for position-based scheduling of chains on a single machine
- Complexity results for single-machine scheduling with positional learning effects
- Strong NP-hardness of scheduling problems with learning or aging effect
- Job release scheduling problem: complexity and an approximation algorithm
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- Scheduling jobs with linear model of simultaneous ageing and learning effects
- Formulating a scheduling problem with almost identical jobs by using positional completion times
- scientific article; zbMATH DE number 4079152 (Why is no real title available?)
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
- A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
- Machine scheduling problems with a position-dependent deterioration
- scientific article; zbMATH DE number 7764095 (Why is no real title available?)
This page was built for publication: Scheduling problems with position dependent job processing times: computational complexity results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761835)
