Model and Algorithm for a Two-Machine Group Scheduling Problem with Setup and Transportation Time

Yu Ni, Shufen Dai, Shuaipeng Yuan (), Bailin Wang and Zhuolun Zhang
Additional contact information
Yu Ni: School of Economics and Management, University of Science and Technology Beijing, No. 30, Xueyuan Road, Haidian District, Beijing 100083, China
Shufen Dai: School of Economics and Management, University of Science and Technology Beijing, No. 30, Xueyuan Road, Haidian District, Beijing 100083, China
Shuaipeng Yuan: School of Economics and Management, University of Science and Technology Beijing, No. 30, Xueyuan Road, Haidian District, Beijing 100083, China
Bailin Wang: School of Economics and Management, University of Science and Technology Beijing, No. 30, Xueyuan Road, Haidian District, Beijing 100083, China
Zhuolun Zhang: School of Economics and Management, University of Science and Technology Beijing, No. 30, Xueyuan Road, Haidian District, Beijing 100083, China

Mathematics, 2024, vol. 12, issue 6, 1-12

Abstract: This paper investigates a two-machine group scheduling problem with sequence-independent setup times and round-trip transportation times, which is derived from the production management requirements of modern steel manufacturing enterprises. The objective is to minimize the makespan. Addressing limitations in prior studies, we consider a critical but largely ignored transportation method, namely round-trip transportation, and restricted transporter capacity between machines. To solve this problem, a mixed-integer programming model is first developed. Then, the problem complexity is analyzed for situations with both single and unlimited transporters. For the NP-hard case of a single transporter, we design an efficient two-stage heuristic algorithm with proven acceptable solution quality bounds. Extensive computational experiments based on steel plant data demonstrate the effectiveness of our approach in providing near-optimal solutions, and the maximum deviation between our algorithm and the optimal solution is 1.38%. This research can provide an operable optimization method that is valuable for group scheduling and transportation scheduling.

Keywords: group scheduling; transportation time; mathematical model; heuristic algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/6/888/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/6/888/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:6:p:888-:d:1358833

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().