A note on resource allocation scheduling with group technology and learning effects on a single machine

Yuan Yuan Lu, Ji Bo Wang, Ping Ji, Hongyu He

Research output: Journal article publicationJournal articleAcademic researchpeer-review

24 Citations (Scopus)


In this article, single-machine group scheduling with learning effects and convex resource allocation is studied. The goal is to find the optimal job schedule, the optimal group schedule, and resource allocations of jobs and groups. For the problem of minimizing the makespan subject to limited resource availability, it is proved that the problem can be solved in polynomial time under the condition that the setup times of groups are independent. For the general setup times of groups, a heuristic algorithm and a branch-and-bound algorithm are proposed, respectively. Computational experiments show that the performance of the heuristic algorithm is fairly accurate in obtaining near-optimal solutions.
Original languageEnglish
Pages (from-to)1621-1632
Number of pages12
JournalEngineering Optimization
Issue number9
Publication statusPublished - 2 Sep 2017


  • group technology
  • heuristic algorithm
  • learning effect
  • resource allocation
  • Scheduling

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this