Skip to main content
Journal ArticleOPEN ACCESS

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

IEEE Access (2019) 7 152998-153011
DOI: 10.1109/ACCESS.2019.2947685
8Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

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.

Author supplied keywords

References Powered by Scopus

Optimization and approximation in deterministic sequencing and scheduling: A survey

Annals of Discrete Mathematics
4846Citations
N/AReaders
Get full text

Formulating the single machine sequencing problem with release dates as a mixed integer program

Discrete Applied Mathematics
191Citations
N/AReaders
Get full text

Structure of a simple scheduling polyhedron

Mathematical Programming
155Citations
N/AReaders
Get full text
View more at Scopus

Cited by Powered by Scopus

A New Multi-Objective Hybrid Flow Shop Scheduling Method to Fully Utilize the Residual Forging Heat

IEEE Access
18Citations
N/AReaders
Get full text

Reclaimer Scheduling in Dry Bulk Terminals

IEEE Access
13Citations
N/AReaders
Get full text

Applications of Stochastic Mixed-Integer Second-Order Cone Optimization

IEEE Access
5Citations
N/AReaders
Get full text
View more at Scopus

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Ying, K. C., Cheng, C. Y., Lin, S. W., & Hung, C. Y. (2019). Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems. IEEE Access, 7, 152998–153011. https://doi.org/10.1109/ACCESS.2019.2947685

Readers over time

‘20‘21‘22‘23‘2402468

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

50%

Professor / Associate Prof. 1

25%

Lecturer / Post doc 1

25%

Readers' Discipline

Tooltip

Engineering 4

50%

Computer Science 2

25%

Social Sciences 1

13%

Medicine and Dentistry 1

13%

Save time finding and organizing research with Mendeley

Sign up for free
0