Scheduling jobs with a V-shaped time-dependent processing time
From MaRDI portal
(Redirected from Publication:2215205)
Recommendations
Cites work
- `` Strong NP-Completeness Results
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
- Complexity of scheduling tasks with time-dependent execution times
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- scientific article; zbMATH DE number 3987032 (Why is no real title available?)
- scientific article; zbMATH DE number 167292 (Why is no real title available?)
- scientific article; zbMATH DE number 3601399 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1285632 (Why is no real title available?)
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 850322 (Why is no real title available?)
- Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
- Models and algorithms of time-dependent scheduling
- Multiagent scheduling. Models and algorithms
- On a scheduling problem of time deteriorating jobs
- On the sum of the first \(n\) prime numbers
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimal composition ordering problems for piecewise linear functions
- Optimization of workcell layouts in a mixed-model assembly line environment
- Parametric problem in scheduling theory
- Scheduling around a small common due date
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling deteriorating jobs to minimize makespan
- Scheduling jobs under simple linear deterioration
- Scheduling jobs with piecewise linear decreasing processing times
- Scheduling jobs with varying processing times
- Scheduling with time dependent processing times: Review and extensions
- Scheduling with time-changing effects and rate-modifying activities
- Scheduling with time-dependent discrepancy times
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- Time-dependent scheduling
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(5)- Scheduling with time-dependent discrepancy times
- scientific article; zbMATH DE number 4079152 (Why is no real title available?)
- Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
- Scheduling jobs with varying processing times
- Minmax delivery completion time scheduling with delivery times and deteriorating jobs
This page was built for publication: Scheduling jobs with a V-shaped time-dependent processing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215205)
