Solution algorithms for the makespan minimization problem with the general learning model

Authors:
Adam Janiak;Władysław Adam Janiak;Radosław Rudek;Agnieszka Wielgus
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11/17, 50-372 Wrocław, Poland;Faculty of Computer Science and Management, Wrocław University of Technology, Łukasiewicza 5, 50-371 Wrocław, Poland;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11/17, 50-372 Wrocław, Poland;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11/17, 50-372 Wrocław, Poland
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 4
Cited 18

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations

Computers and Industrial Engineering
The learning effect: Getting to the core of the problem

Information Processing Letters
A new approach to the learning effect: Beyond the learning curve restrictions

Computers and Operations Research

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
Scheduling problems with deteriorating jobs and learning effects including proportional setup times

Computers and Industrial Engineering
Scheduling with job-dependent learning effects and multiple rate-modifying activities

Information Processing Letters
Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times

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
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
The single-machine total weighted tardiness scheduling problem with position-based learning effects

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

Computers and Industrial Engineering
Two-agent scheduling with learning consideration

Computers and Industrial Engineering
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

Information Sciences: an International Journal
A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects

Information Sciences: an International Journal
The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model

Information Sciences: an International Journal
Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position

Information Sciences: an International Journal
An Agent Based Approach to Patient Scheduling Using Experience Based Learning

International Journal of Agent Technologies and Systems
Several flow shop scheduling problems with truncated position-based learning effect

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the papers devoted to scheduling problems with the learning effect concern the Wright's learning curve. On the other hand, the study about learning has pointed out that the learning curve in practice is very often an S-shaped function, which has not been considered in scheduling. Thus, in this paper, a single processor makespan minimization problem with an S-shaped learning model is investigated. We prove that this problem is strongly NP-hard even if the experience provided by each job is equal to its normal processing time. Therefore, to solve this problem, we prove some eliminating properties that are used to construct a branch and bound algorithm and some fast heuristic methods. Since the proposed algorithms are dedicated for the general case, i.e., where job processing times are arbitrary non-increasing experience dependent functions, their efficiency is verified numerically for the S-shaped model.