Gao, F., Liu, M., Wang, J.J. and Lu, Y.Y. (2017) No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with Learning Effect, Common Due Date and Controllable Job Processing Times. International Journal of Production Research. https://doi.org/10.1080/00207543.2017.1371353

has been cited by the following article:

• TITLE: Flow Shop Scheduling Problem with Convex Resource Allocation and Learning Effect

  AUTHORS: Xinna Geng, Jibo Wang, Chou-Jung Hsu

  KEYWORDS: Learning Effect, No-Wait, Flow Shop, Convex Resource Allocation

  JOURNAL NAME: Journal of Computer and Communications, Vol.6 No.1, December 29, 2017

  ABSTRACT: In this paper, we consider the no-wait two-machine scheduling problem with convex resource allocation and learning effect under the condition of common due date assignment. We take the total earliness, tardiness and common due date cost as the objective function, and find the optimal common due date, the resource allocation and the schedule of jobs to make the objective function minimum under the constraint condition that the total resource is limited. The corresponding algorithm is given and proved that the problem can be solved in polynomial time.