Parallel-machine scheduling with identical machine resource capacity limits and DeJong’s learning effect
Authors:
- 30 March 2021
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (9) , 2753-2765
Abstract
We consider parallel-machine scheduling with identical machine resource capacity limits and DeJong’s learning effect. Each job has a resource consumption requirement and a normal processing time. The actual processing time of a job is a function of its normal processing time, subject to DeJong’s learning effect, while the resource consumption of a job is a function of its actual processing time. Each machine has the same resource capacity limit. The objective is to maximise the minimum machine load. Considering three resource consumption functions, namely, linear, concave, and convex, we show that all three scheduling models are NP-hard and propose two approximation algorithms for the models and analyse their worst-case ratios.Keywords
Funding Information
- National Natural Science Foundation of China (11971434)
- Zhejiang Provincial Natural Science Foundation of China (LY21G010002)
- Research Institute of Social Sciences and Humanities of the Ministry of Education of China
- Hong Kong Polytechnic University
This publication has 24 references indexed in Scilit:
- Machine scheduling with DeJong’s learning effectComputers & Industrial Engineering, 2015
- Comparing the minimum completion times of two longest-first scheduling-heuristicsCentral European Journal of Operations Research, 2011
- Maximizing the minimum completion time on parallel machines4OR, 2007
- Single-machine scheduling with learning considerationsEuropean Journal of Operational Research, 1999
- A polynomial-time approximation scheme for maximizing the minimum machine completion timeOperations Research Letters, 1997
- The exact LPT-bound for maximizing the minimum completion timeOperations Research Letters, 1992
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor SystemSIAM Journal on Algebraic Discrete Methods, 1982
- Analysis of Greedy Solutions for a Replacement Part Sequencing ProblemMathematics of Operations Research, 1981
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978