A note on single machine common flow allowance group scheduling with learning effect and resource allocation

2020 ◽  
pp. 106941
Author(s):  
Dan-Yang Lv ◽  
Si-Wen Luo ◽  
Jing Xue ◽  
Jing-Xiao Xu ◽  
Ji-Bo Wang
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Group Scheduling ◽  
Flow Allowance

Single-machine group scheduling with resource allocation and learning effect

2011 ◽  
Vol 60 (1) ◽  
pp. 148-157 ◽  
Author(s):  
Zhanguo Zhu ◽  
Linyan Sun ◽  
Feng Chu ◽  
Ming Liu
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Group Scheduling ◽  
Machine Group

A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity

2017 ◽  
Vol 34 (04) ◽  
pp. 1750011 ◽  
Author(s):  
Zhusong Liu ◽  
Zhenyou Wang ◽  
Yuan-Yuan Lu
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maintenance Activity ◽  
Optimal Resource ◽  
Deteriorating Maintenance ◽  
Polynomially Solvable ◽  
Completion Times

This paper considers the single machine scheduling with learning effect, resource allocation and deteriorating maintenance activity simultaneously. For the convex resource allocation consumption function, we provide a bicriteria analysis where the first (schedule) criterion is to minimize the total weighted sum of makespan, total completion time and total absolute differences in completion times, and the second (resource) criterion is to minimize the total weighted resource consumption. Our aim is to find the optimal resource allocations and job sequence that minimize the three different models of considering the two criterion. We show that these three models are polynomially solvable respectively.

Single-Machine Scheduling with Resource-Dependent Learning Effect and Deteriorating Jobs

2013 ◽  
Vol 423-426 ◽  
pp. 2224-2227
Author(s):  
Yan Peng Fan ◽  
Chuan Li Zhao
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Operation Time ◽  
Deteriorating Jobs ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Machine Scheduling ◽  
Optimal Sequence ◽  
Dependent Learning

This paper considers single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. The processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal sequence of jobs and optimal resource allocation so as to minimize the sum of earliness, tardiness, due-windows and resource and operation time cost, the considered problem is molded as an assignment problem and can be solved with a polynomial time algorithm.

Sign in / Sign up

Export Citation Format

Share Document