A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Mathematics of Operations Research
Scheduling groups of unit length jobs on two identical parallel machines
Information Processing Letters
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
SIAM Journal on Optimization
Convex resource allocation for minimizing the makespan in a single machine with job release dates
Computers and Operations Research
Single-machine group scheduling with a time-dependent learning effect
Computers and Operations Research
Computers and Operations Research
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Single-machine group scheduling problems with deterioration consideration
Computers and Operations Research
Minimizing total tardiness on a single machine with controllable processing times
Computers and Operations Research
Scheduling problems with deteriorating jobs and learning effects including proportional setup times
Computers and Industrial Engineering
Single-machine group scheduling problems under the effects of deterioration and learning
Computers and Industrial Engineering
Optimal due date assignment and resource allocation in a group technology scheduling environment
Computers and Operations Research
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect
Computers and Industrial Engineering
Single-machine scheduling with learning effect and resource-dependent processing times
Computers and Industrial Engineering
Single machine scheduling with common due date assignment in a group technology environment
Mathematical and Computer Modelling: An International Journal
Group sequencing around a common due date
Discrete Optimization
Single machine batch scheduling with deadlines and resource dependent processing times
Operations Research Letters
Computers and Industrial Engineering
Computers and Industrial Engineering
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves
Computers and Industrial Engineering
Hi-index | 0.00 |
This paper addresses single-machine scheduling problems under the consideration of learning effect and resource allocation in a group technology environment. In the proposed model of this paper the actual processing times of jobs depend on the job position, the group position, and the amount of resource allocated to them concurrently. Learning effect and two resource allocation functions are examined for minimizing the weighted sum of makespan and total resource cost, and the weighted sum of total completion time and total resource cost. We show that the problems for minimizing the weighted sum of makespan and total resource cost remain polynomially solvable. We also prove that the problems for minimizing the weighted sum of total completion time and total resource cost have polynomial solutions under certain conditions.