Two-machine flow shop problem with effects of deterioration and learning

Authors:
Ji-Bo Wang;Li-Li Liu
Affiliations:
Operations Research and Cybernetics Institute, School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People's Republic of China;School of Science, Shanghai Second Polytechnic University, Shanghai 201209, People's Republic of China
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 12
Cited 11

Scheduling deteriorating jobs on a single processor

Operations Research
V-shaped policies for scheduling deteriorating jobs

Operations Research
Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
Scheduling jobs under decreasing linear deterioration

Information Processing Letters
Single-machine scheduling with general learning functions

Computers & Mathematics with Applications
Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect

Computers and Industrial Engineering
Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

Computers & Mathematics with Applications

Single-machine group scheduling problems under the effects of deterioration and learning

Computers and Industrial Engineering
Minimizing the makespan on a single machine with learning and unequal release times

Computers and Industrial Engineering
Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times

Computers and Operations Research
A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

Computers and Operations Research
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
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect

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

Computers and Industrial Engineering
Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration

Computers and Industrial Engineering
Joint reply to the erratum and the note on "Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning" [Math. Comput. Modelling 50 (2009) 401-406]

Mathematical and Computer Modelling: An International Journal
Makespan minimization flowshop with position dependent job processing times-computational complexity and solution algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the total completion time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and some lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm. A heuristic algorithm is also proposed, which is shown by computational experiments to perform effectively and efficiently in obtaining near-optimal solutions.