Single machine problem with multi-rate-modifying activities under a time-dependent deterioration
Summary: The single machine scheduling problem with multi-rate-modifying activities under a time-dependent deterioration to minimize makespan is studied. After examining the characteristics of the problem, a number of properties and a lower bound are proposed. A branch and bound algorithm and a heuristic algorithm are used in the solution, and two special cases are also examined. The computational experiments show that, for the situation with a rate-modifying activity, the proposed branch and bound algorithm can solve situations with 50 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal solution with an error percentage less than 0.053 in a very short time. In situations with multi-rate-modifying activities, the proposed branch and bound algorithm can solve the case with 15 jobs within a reasonable time, and the heuristic algorithm can obtain the near-optimal with an error percentage less than 0.070 in a very short time. The branch and bound algorithm and the heuristic algorithm are both shown to be efficient and effective.
- Problems of single-machine scheduling with rate-modifying activities under deterioration
- An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
- An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
- Single-machine scheduling problems with an actual time-dependent deterioration
- Single machine scheduling problem with batch setups involving positional deterioration effects and multiple rate-modifying activities
- Single-machine scheduling with accelerating deterioration effects
- Single-machine scheduling with job-dependent machine deterioration
- Single-machine total completion time scheduling with a time-dependent deterioration
- scientific article; zbMATH DE number 6531643
- Single-machine scheduling with upper bounded maintenance time under the deteriorating effect
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Machine scheduling with a rate-modifying activity
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive scheduling with simple linear deterioration on a single machine
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling linear deteriorating jobs with rejection on a single machine
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs
- An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model
- An efficient time algorithm for makespan objectives
- An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
- Scheduling position-based deteriorating jobs with multiple rate-modifying activities and past-sequence-dependent delivery times
- Problems of single-machine scheduling with rate-modifying activities under deterioration
This page was built for publication: Single machine problem with multi-rate-modifying activities under a time-dependent deterioration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364253)
