Selected topics on assignment problems
Discrete Applied Mathematics
Computers and Industrial Engineering
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
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
Information Sciences: an International Journal
Some single-machine and m-machine flowshop scheduling problems with learning considerations
Information Sciences: an International Journal
Two-machine flow shop problem with effects of deterioration and learning
Computers and Industrial Engineering
Single-machine scheduling with learning effect and deteriorating jobs
Computers and Industrial Engineering
Experience-based approach to scheduling problems with the learning effect
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Some scheduling problems with deteriorating jobs and learning effects
Computers and Industrial Engineering
Scheduling problems with deteriorating jobs and learning effects including proportional setup times
Computers and Industrial Engineering
Single-machine group scheduling problems under the effects of deterioration and learning
Computers and Industrial Engineering
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Information Processing Letters
Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect
Computers and Industrial Engineering
Computers and Industrial Engineering
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves
Computers and Industrial Engineering
Computers and Operations Research
Several flow shop scheduling problems with truncated position-based learning effect
Computers and Operations Research
Information Sciences: an International Journal
Flowshop scheduling with a general exponential learning effect
Computers and Operations Research
| Hi-index | 0.01 |
In this paper, we analyze the two-machine flowshop problem with the makespan minimization and the learning effect, which computational complexity was not determined yet. First, we show that an optimal solution of this problem does not have to be the 'permutation' schedule if the learning effect is taken into consideration. Furthermore, it is proved that the permutation and non-permutation versions of this problem are NP-hard even if the learning effect, in a form of a step learning curve, characterizes only one machine. However, if both machines have learning ability and the learning curves are stepwise then the permutation version of this problem is strongly NP-hard. Furthermore, we prove the makespan minimization problem in m-machine permutation proportional flowshop environment remains polynomially solvable with identical job processing times on each machine even if they are described by arbitrary functions (learning curves) dependent on a job position in a sequence. Finally, approximation algorithms for the general problem are proposed and analyzed.