Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems

Kuo-Ching Ying; Chen-Yang Cheng; Shih-Wei Lin; Chia-Yang Hung

doi:10.1109/ACCESS.2019.2947685

IEEE Access (Jan 2019)

Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems

Kuo-Ching Ying,
Chen-Yang Cheng,
Shih-Wei Lin,
Chia-Yang Hung

Affiliations

Kuo-Ching Ying: ORCiD; Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan
Chen-Yang Cheng: Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan
Shih-Wei Lin: ORCiD; Department of Information Management, Chang Gung University, Taoyuan, Taiwan
Chia-Yang Hung: United Microelectronics Corporation, Hsinchu, Taiwan

DOI: https://doi.org/10.1109/ACCESS.2019.2947685
Journal volume & issue: Vol. 7
pp. 152998 – 153011

Abstract

Read online

This study evaluates various Mixed Integer Programming (MIP) formulations for solving single-machine and parallel-machine scheduling problems, with the objective of minimizing the total completion time and the makespan of jobs. Through extensive numerical study, the MIP formulation, which is suitable for dealing with each specific single-machine or parallel-machine scheduling problem, is identified. Benchmarks are also provided for the development of other algorithms for future research.

Published in IEEE Access

ISSN: 2169-3536 (Online)
Publisher: IEEE
Country of publisher: United States
LCC subjects: Technology: Electrical engineering. Electronics. Nuclear engineering
Website: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639

About the journal

Abstract

Keywords