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

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 suitabl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 7; s. 152998 - 153011
Hlavní autoři: Ying, Kuo-Ching, Cheng, Chen-Yang, Lin, Shih-Wei, Hung, Chia-Yang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Completion time
Industrial engineering
Integer programming
Job shop scheduling
Job shops
Linear programming
makespan
Mixed integer
Optimal scheduling
parallel-machine
Scheduling
Single machine scheduling
single-machine
total completion time
ISSN:2169-3536, 2169-3536
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2947685