Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines

2018 ◽  
Vol 78 (4) ◽  
pp. 693-715 ◽  
Author(s):  
Min Kong ◽  
Xinbao Liu ◽  
Jun Pei ◽  
Panos M. Pardalos ◽  
Nenad Mladenovic
Keyword(s):  
Parallel Machines ◽  
Unrelated Parallel Machines ◽  
Parallel Batching ◽  
Processing Times ◽  
Nonlinear Processing

scholarly journals Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Guang-Qian Zhang ◽  
Jian-Jun Wang ◽  
Ya-Jing Liu
Keyword(s):  
Resource Allocation ◽  
Parallel Machines ◽  
Waiting Times ◽  
Optimal Schedule ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Unrelated Parallel Machines ◽  
Scheduling Problems ◽  
Processing Times ◽  
Parallel Machines Scheduling

munrelated parallel machines scheduling problems with variable job processing times are considered, where 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 resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, the total absolute differences in completion (waiting) times on all machines, and total resource cost. If the number of machines is a given constant number, we propose a polynomial time algorithm to solve the problem.

Sign in / Sign up

Export Citation Format

Share Document