logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

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

delete2019-01-01
delete6
delete
OA
AI
K
Kuo‐Ching Ying
C
Chen-Yang Cheng
S
Shih-Wei Lin *
C
Chia-Yang Hung
DOI：10.1109/ACCESS.2019.2947685delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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.
Keywords:
Job shop scheduling
Optimal scheduling
Single machine scheduling
Linear programming
Licenses
Industrial engineering
Scheduling
total completion time
makespan
single-machine
parallel-machine
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

C
Chang Gung University
Scholars:
1.3W
Papers: 1.2W
Citations: 1.2W
N
National Taipei University of Technology
Scholars:
7.1K
Papers: 7.3K
Citations: 6.8K
U
united microelectronics corporation
Scholars:
66
Papers: 51
Citations: 0
researcher View more organizations