A heuristic algorithm for mean flowtime objective in flowshop scheduling
Computers and Operations Research
Minimizing Total Completion Time in a Two-Machine
Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Solution algorithms for the makespan minimization problem with the general learning model
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
Experience-based approach to scheduling problems with the learning effect
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Total absolute deviation of job completion times on uniform and unrelated machines
Computers and Operations Research
Proportionate flowshops with general position-dependent processing times
Information Processing Letters
Some single-machine scheduling problems with a truncation learning effect
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Industrial Engineering
Scheduling with general position-based learning curves
Information Sciences: an International Journal
Computers and Operations Research
Single-Machine Scheduling With Job-Position-Dependent Learning and Time-Dependent Deterioration
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Scheduling on parallel identical machines with job-rejection and position-dependent processing times
Information Processing Letters
Flowshop scheduling with a general exponential learning effect
Computers and Operations Research
| Hi-index | 0.01 |
The concept of truncated position-based learning process plays a key role in production environments. However, it is relatively unexplored in the flow shop setting. In this paper, we consider the flow shop scheduling with truncated position-based learning effect, i.e., the actual processing time of a job is a function of its position and a control parameter in a processing permutation. The objective is to minimize one of the six regular performance criteria, namely, the total completion time, the makespan, the total weighted completion time, the discounted total weighted completion time, the sum of the quadratic job completion times, and the maximum lateness. We present heuristic algorithms and analyze the worst-case bound of these heuristic algorithms. We also provide the computational results to evaluate the performance of the heuristics.