Scheduling problems with position dependent job processing times: computational complexity results
From MaRDI portal
Publication:1761835
DOI10.1007/s10479-012-1098-1zbMath1251.90181OpenAlexW2029348542MaRDI QIDQ1761835
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1098-1
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (21)
Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation ⋮ Scheduling with a position-weighted learning effect and job release dates ⋮ Parallel-machine scheduling with maintenance: praising the assignment problem ⋮ Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection ⋮ Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date ⋮ Strong NP-hardness of scheduling problems with learning or aging effect ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Approximation algorithms for some position-dependent scheduling problems ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ 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 ⋮ Multitasking scheduling problems with deterioration effect ⋮ Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Machine scheduling problems with a position-dependent deterioration ⋮ Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time ⋮ Polyhedral results for position-based scheduling of chains on a single machine ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads ⋮ Two-agent scheduling problems with the general position-dependent processing time ⋮ A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects ⋮ A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
Cites Work
- Unnamed Item
- Single-machine scheduling with deteriorating functions for job processing times
- Scheduling problems with general effects of deterioration and learning
- Single-machine scheduling problems with time and position dependent processing times
- A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Time-dependent scheduling
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
- Single-machine scheduling with learning considerations
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A concise survey of scheduling with time-dependent processing times
- Single-machine scheduling with both deterioration and learning effects
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- A state-of-the-art review on scheduling with learning effects
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- A Theory of the Learning Process
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling with a learning effect
- Scheduling jobs with position-dependent processing times
- Scheduling jobs under an aging effect
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- Single machine scheduling with learning effect considerations
This page was built for publication: Scheduling problems with position dependent job processing times: computational complexity results
