Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology
- 2 July 2019
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 52 (7) , 1184-1197
Abstract
This article deals with a single-machine resource allocation scheduling problem with deteriorating jobs. Under a group technology environment, the actual processing times of jobs are a convex resource allocation function of their starting time and the amount of resource allocation. The objective is to minimize the weighted sum of makespan and resource allocation cost. For two special cases, it is proved that the problem can be solved in polynomial time. For the general case of the problem, heuristic and branch-and-bound procedures are developed to solve the problem. Computational experiments are also performed to examine the effectiveness and the efficiency of the algorithms.Keywords
Funding Information
- Liaoning University (LR2016017)
- Liaoning BaiQianWan Talents Program
- National Natural Science Foundation of China (71871091, 71673082)
This publication has 23 references indexed in Scilit:
- Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing timeJournal of the Operational Research Society, 2014
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobsApplied Mathematical Modelling, 2013
- A note on optimal policies for two group scheduling problems with deteriorating setup and processing timesComputers & Industrial Engineering, 2010
- Basics of time-dependent scheduling2008
- Single machine group scheduling with general linear deterioration to minimize the makespanThe International Journal of Advanced Manufacturing Technology, 2008
- A two-machine flowshop makespan scheduling problem with deteriorating jobsComputers & Industrial Engineering, 2008
- Single-machine group scheduling problems with deteriorating jobsThe International Journal of Advanced Manufacturing Technology, 2007
- A survey of scheduling with controllable processing timesDiscrete Applied Mathematics, 2007
- Scheduling with time dependent processing times: Review and extensionsJournal of the Operational Research Society, 1999
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979