On the two-machine flowshop scheduling problems with processing time linearly dependent on job waiting-time

摘要

This paper presents two flowshop scheduling problems where the processing times are linearly dependent on the waiting times of the jobs prior to processing on the second machine. These problems are shown to be NP-hard and two heuristic algorithms with computational experiments are provided.