Minimizing total completion time scheduling problem with ready times and linear deterioration functions of processing times
Authors:
- 8 December 2025
- journal article
- research article
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (1) , 42
Abstract
No abstract availableKeywords
This publication has 79 references indexed in Scilit:
- Multiple identical serial-batch machines scheduling with release dates and submodular rejection penaltiesJournal of Combinatorial Optimization, 2025
- Minimizing the maximum lateness for scheduling with release times and job rejectionJournal of Combinatorial Optimization, 2024
- Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocationsJournal of Applied Mathematics and Computing, 2024
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobsJournal of Combinatorial Optimization, 2023
- Optimization of scheduling problems with deterioration effects and an optional maintenance activityJournal of Scheduling, 2022
- The due date assignment scheduling problem with the deteriorating jobs and delivery timeJournal of Applied Mathematics and Computing, 2021
- Models and Algorithms of Time-Dependent Scheduling2020
- Bicriterion scheduling with group technology and deterioration effectJournal of Applied Mathematics and Computing, 2018
- Scheduling with Time-Changing Effects and Rate-Modifying Activities2017
- An optimal single-machine scheduling with linear deterioration rate and rate-modifying activitiesJournal of Combinatorial Optimization, 2014