NP-hard cases in scheduling deteriorating jobs on dedicated machines
From MaRDI portal
(Redirected from Publication:4658457)
Recommendations
- On a scheduling problem of time deteriorating jobs
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- scientific article; zbMATH DE number 2100940
- Parallel-machine scheduling of simple linear deteriorating jobs
Cited in
(43)- Single machine parallel-batch scheduling with deteriorating jobs
- Complexity analysis of job-shop scheduling with deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total weighted completion time of deteriorating jobs
- Identical parallel machine scheduling with time-dependent processing times
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Single-machine ready times scheduling with group technology and proportional linear deterioration
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Retracted article: Multi-objective open shop scheduling by considering human error and preventive maintenance
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
- A note on the complexity of scheduling problems with linear job deterioration
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Single machine group scheduling under decreasing linear deterioration
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
- Minimizing makespan in permutation flow shop scheduling with proportional deterioration
- Permutation flow shop problem with shortening job processing times
- Makespan minimization on three-machine flow shop with deteriorating jobs
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
- Single machine scheduling with linear deteriorating jobs under predictive disruption
- Scheduling proportionally deteriorating jobs in two-machine open shop with a non-bottleneck machine
- Scheduling deteriorating jobs with rejection on dominant machines
- Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption
- Single-machine scheduling with deteriorating jobs
- Permutation flowshop scheduling with simple linear deterioration
- Two-machine open shop scheduling with deteriorating job to the number of tardy jobs
- Single machine two-agent scheduling with deteriorating jobs
- Scheduling dedicated jobs with variative processing times
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
- A note on the complexity of flow-shop scheduling with deteriorating jobs
- Theory and methodology of time-dependent scheduling: past, present and future
- Two-agent scheduling with time-dependent and position-dependent in a flow-shop system
- Single-machine scheduling with nonlinear deterioration
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling time-dependent jobs under mixed deterioration
- Rescheduling problems with deteriorating jobs under disruptions
- The Browne-Yechiali single-machine sequence is optimal for flow-shops
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
This page was built for publication: NP-hard cases in scheduling deteriorating jobs on dedicated machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658457)
