Next Article in Journal
Time-Frequency Response of Acoustic Emission and Its Multi-Fractal Analysis for Rocks with Different Brittleness under Uniaxial Compression
Next Article in Special Issue
A Decentralized Optimization Algorithm for Multi-Agent Job Shop Scheduling with Private Information
Previous Article in Journal
Fuzzy Techniques and Adjusted Mixture Design-Based Scenario Analysis in the CLMV (Cambodia, Lao PDR, Myanmar and Vietnam) Subregion for Multi-Criteria Decision Making in the Apparel Industry
Previous Article in Special Issue
Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation

1
School of Economics, Shenyang University, Shenyang 110096, China
2
Institute of Carbon Neutrality Technology and Policy, Shenyang University, Shenyang 110044, China
3
School of Statistics, Dongbei University of Finance and Economics, Dalian 116025, China
4
School of Science, Shenyang Aerospace University, Shenyang 110136, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(23), 4745; https://doi.org/10.3390/math11234745
Submission received: 25 October 2023 / Revised: 17 November 2023 / Accepted: 21 November 2023 / Published: 23 November 2023
(This article belongs to the Special Issue Optimization in Scheduling and Control Problems)

Abstract

Green scheduling that aims to enhance efficiency by optimizing resource allocation and job sequencing concurrently has gained growing academic attention. To tackle such problems with the consideration of scheduling and resource allocation, this paper considers a single-machine group scheduling problem with common/slack due-date assignment and a controllable processing time. The objective is to decide the optimized schedule of the group/job sequence, resource allocation, and due-date assignment. To solve the generalized case, this paper proves several optimal properties and presents a branch-and-bound algorithm and heuristic algorithms. Numerical experiments show that the branch-and-bound algorithm is efficient and the heuristic algorithm developed based on the analytical properties outruns the tabu search.
Keywords: scheduling; single machine; resource allocation; group technology; due-date assignment scheduling; single machine; resource allocation; group technology; due-date assignment

Share and Cite

MDPI and ACS Style

He, H.; Zhao, Y.; Ma, X.; Lv, Z.-G.; Wang, J.-B. Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation. Mathematics 2023, 11, 4745. https://doi.org/10.3390/math11234745

AMA Style

He H, Zhao Y, Ma X, Lv Z-G, Wang J-B. Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation. Mathematics. 2023; 11(23):4745. https://doi.org/10.3390/math11234745

Chicago/Turabian Style

He, Hongyu, Yanzhi Zhao, Xiaojun Ma, Zheng-Guo Lv, and Ji-Bo Wang. 2023. "Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation" Mathematics 11, no. 23: 4745. https://doi.org/10.3390/math11234745

APA Style

He, H., Zhao, Y., Ma, X., Lv, Z.-G., & Wang, J.-B. (2023). Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation. Mathematics, 11(23), 4745. https://doi.org/10.3390/math11234745

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop