Single-machine group scheduling with both learning effects and deteriorating jobs

Authors:
Xue Huang;Ming-Zheng Wang;Ji-Bo Wang
Affiliations:
School of Science, Shenyang Aerospace University, Shenyang 110136, China;School of Management Science and Engineering, Dalian University of Technology, Dalian 116024, China;School of Science, Shenyang Aerospace University, Shenyang 110136, China
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 9
Cited 4

Time-optimal control in a single machine problem with resource constraints

Automatica (Journal of IFAC)
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
Single-machine group scheduling with a time-dependent learning effect

Computers and Operations Research
Single-machine group scheduling problems with deterioration consideration

Computers and Operations Research
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
Time-Dependent Scheduling

Time-Dependent Scheduling
Some single-machine and m-machine flowshop scheduling problems with learning considerations

Information Sciences: an International Journal
Single machine scheduling with time-dependent deterioration and exponential learning effect

Computers and Industrial Engineering
Single-machine scheduling time-dependent jobs with resource-dependent ready times

Computers and Industrial Engineering

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

Computers and Industrial Engineering
Short Communication: A note on "Single machine scheduling with time-dependent deterioration and exponential learning effect"

Computers and Industrial Engineering
Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects

Computers and Industrial Engineering
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper two resource constrained single-machine group scheduling problems with both learning effects and deteriorating jobs are considered. By learning effects, deteriorating jobs and group technology assumption, we mean that the processing time of a job is defined by the function of its starting time and position in the group, and the group setup times of a group is a positive strictly decreasing continuous function of the amount of consumed resource. We present polynomial solutions for the makespan minimization problem under the constraint that the total resource consumption does not exceed a given limit, and the total resource consumption minimization problem under the constraint that the makespan does not exceed a given limit, respectively.