Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Issue 2 (1st February 2019)

• Record Type: Journal Article
• Authors: Wang, Ji-Bo; Liang, Xi-Xi
• Is Part Of: Engineering optimization. Volume 51:Issue 2(2019)
• Page Start: 231
• Page End: 246
• Publication Date: 2019-02-01
• Subjects: Scheduling -- deteriorating job -- resource allocation -- group technology -- branch-and-bound (B&B) algorithm; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2018.1454442
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This study considers a single machine group scheduling problem with deteriorating jobs and resource allocation (controllable processing times). The objective is to have the resource availability limited within a given range, and to minimize the maximum completion time ( i.e. the makespan). For two special cases, it is proved that the problem can be solved in polynomial time. For the general case, an heuristic algorithm and a branch-and-bound algorithm are proposed. Computational results show that the proposed heuristic algorithm is generally effective.