Single-machine scheduling with learning effect and resource-dependent processing times

Authors:
Dan Wang;Ming-Zheng Wang;Ji-Bo Wang
Affiliations:
Operations Research and Cybernetics Institute, School of Science, Shenyang Aerospace University, Shenyang 110136, China;School of Management, Dalian University of Technology, Dalian 116024, China;Operations Research and Cybernetics Institute, School of Science, Shenyang Aerospace University, Shenyang 110136, China and Knowledge Management and Innovation Research Centre, Xi'an Jiaotong Univ ...
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 15
Cited 6

Simultaneous minimization of mean and variation flow time and waiting in single machine systems

Operations Research
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Some comments on sequencing with controllable processing times

Computing
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

Information Processing Letters
Single machine scheduling with a variable common due date and resource-dependent processing times

Computers and Operations Research
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

Journal of Scheduling
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Information Sciences: an International Journal
Some scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Single-machine and flowshop scheduling with a general learning effect model

Computers and Industrial Engineering
Some single-machine and m-machine flowshop scheduling problems with learning considerations

Information Sciences: an International Journal
Single-machine scheduling time-dependent jobs with resource-dependent ready times

Computers and Industrial Engineering

Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects

Computers and Industrial Engineering
Two-machine flowshop scheduling with truncated learning to minimize the total completion time

Computers and Industrial Engineering
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves

Computers and Industrial Engineering
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. We analyse the problem with two different processing time functions. For each combination of these, we provide a polynomial time algorithm to find the optimal job sequence and resource allocation.