A single-machine deteriorating job scheduling problem with a non-regular criterion
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm to minimize completion time variance on a single processor.
- A concise survey of scheduling with time-dependent processing times
- A note on scheduling problems with learning effect and deteriorating jobs
- A note on single-processor scheduling with time-dependent execution times
- A tight lower bound for the completion time variance problem
- Completion time variance minimization on a single machine is difficult
- Mimimization of agreeably weighted variance in single machine systems
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing completion time variance with compressible processing times
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Minimizing Variation of Flow Time in Single Machine Systems
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
- Proof of a conjecture of Schrage about the completion time variance problem
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling jobs under decreasing linear deterioration
- Scheduling jobs under simple linear deterioration
- Scheduling jobs with piecewise linear decreasing processing times
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- Scheduling with time dependent processing times: Review and extensions
- Single machine group scheduling under decreasing linear deterioration
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Single machine scheduling with step-deteriorating processing times
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- The complexity of scheduling starting time dependent tasks with release times
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(12)- A branch and price algorithm for single-machine completion time variance
- Minimizing makespan in permutation flow shop scheduling with proportional deterioration
- Makespan minimization on three-machine flow shop with deteriorating jobs
- A note on ``Scheduling problems with the effects of deterioration and learning
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Scheduling deteriorating jobs with availability constraints to minimize the makespan
- Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- Some scheduling problems on a single machine with general job effects of position-dependent learning and start-time-dependent deterioration
- Single-machine scheduling with nonlinear deterioration
- A note on scheduling deteriorating jobs
This page was built for publication: A single-machine deteriorating job scheduling problem with a non-regular criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013563)
