Photo from wikipedia
This paper addresses flow shop scheduling problems with sum-of-logarithm-processing-times-based learning effects. The objective is to minimize the total completion time, the makespan, the total weighted completion time, and the sum… Click to show full abstract
This paper addresses flow shop scheduling problems with sum-of-logarithm-processing-times-based learning effects. The objective is to minimize the total completion time, the makespan, the total weighted completion time, and the sum of the quadratic job completion times, respectively. Heuristic algorithms based on the optimal schedules for the corresponding flow shop scheduling problems are presented and their worst-case error bounds are also analyzed.
Keywords:
shop scheduling;
logarithm processing;
processing times;
flow shop;
sum logarithm
Journal Title: Journal of Applied Mathematics and Computing
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Applied Mathematics and Computing
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!