Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs. Issue 5 (4th May 2019)

• Record Type: Journal Article
• Authors: Liu, Feng; Yang, Jing; Lu, Yuan-Yuan
• Is Part Of: Engineering optimization. Volume 51:Issue 5(2019)
• Page Start: 862
• Page End: 874
• Publication Date: 2019-05-04
• Subjects: Group technology -- scheduling -- branch-and-bound -- deteriorating job; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2018.1500562
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This article considers the single-machine group scheduling problem with deterioration effect and ready times. The objective of this problem is to determine the sequence of groups and the sequence of jobs to minimize the makespan. To solve the problem, an algorithm based on enumeration, an heuristic algorithm and a branch-and-bound algorithm are developed and exhaustively tested. The computational results show that the performance of the heuristic algorithm is fairly accurate in obtaining near-optimal solutions and the branch-and-bound algorithm is very effective in obtaining optimal solutions.